Computing the Radio Number via Multilevel Distance Labelings for Connected Graphs

Munawwar Hussain, M. Tariq Rahim, Zeeshan Saleem Mufti, Ali Tabraiz and Gamachu Adugna Ganati

Journal of Mathematics, 2026, vol. 2026, 1-9

Abstract: Suppose G is a connected graph. For any two vertices s and t, let dG (s,t) denote the distance between s and t in G. The diameter of G is the maximum distance between any pair of vertices, and it is denoted by diamG. A multilevel distance labeling is a function VG⟶Z+, such that for any two vertices s≠t, we have ds,t+fs−ft≥diamG+1. The condition ds,t+fs−ft≥diamG+1 will be referred to as the multilevel distance labeling or the radio condition. The span of f is the largest positive integer in the range of. The minimum span of a multilevel distance labeling for G is called the radio number, represented by G. In this article, we compute the multilevel distance labeling of some graphs.

Date: 2026
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/jmath/2026/5638577.pdf (application/pdf)
http://downloads.hindawi.com/journals/jmath/2026/5638577.xml (application/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jjmath:5638577

DOI: 10.1155/jom/5638577

Access Statistics for this article

More articles in Journal of Mathematics from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().