A different approach for multi-level distance labellings of path structure networks.

This article discusses the concept of radio k-labellings of graphs and presents results on the radio k-chromatic number of path Pn for k = 2, 3, and 4. The authors provide lower bounds for the radio-chromatic number of a path and introduce definitions and lemmas related to path labeling and radio labeling. The text is highly technical and may require further study for a complete understanding. The paper acknowledges the financial support of the National Board for Higher Mathematics (NBHM) in India. [Extracted from the article]