The Radio numbers of all graphs of order n and diameter n-2
Keywords:
Radio numberAbstract
A radio labeling of a simple connected graph G is a function c:V(G) \to Z_+ such that for every two distinct vertices u and v of G
distance(u,v)+|c(u)-c(v)|\geq 1+ diameter(G).
The radio number of a graph G is the smallest integer M for which there exists a labeling c with c(v)\leq M for all v\in V(G). The radio number of graphs of order n and diameter n-1, i.e., paths, was determined in [7]. Here we determine the radio numbers of all graphs of order n and diameter n-2.
Downloads
Published
Issue
Section
License
The authors retain all rights to the original work without any restrictions.
License for Published Contents
"Le Matematiche" published articlesa are distribuited with Creative Commons Attribution 4.0 International. You are free to copy, distribute and transmit the work, and to adapt the work. You must attribute the work in the manner specified by the author or licensor (but not in any way that suggests that they endorse you or your use of the work).
License for Metadata
"Le Matematiche" published articles metadata are dedicated to the public domain by waiving all publisher's rights to the work worldwide under copyright law, including all related and neighboring rights, to the extent allowed by law.
You can copy, modify, distribute and perform the work, even for commercial purposes, all without asking permission.
No Fee Charging
No fee is required to complete the submission/review/publishing process of authors paper.
