The Radio numbers of all graphs of order $n$ and diameter $n-2$
From MaRDI portal
Publication:2868766
zbMath1278.05206arXiv1206.6327MaRDI QIDQ2868766
Katherine F. Benson, Maggy Tomova, Matthew Porter
Publication date: 19 December 2013
Full work available at URL: https://arxiv.org/abs/1206.6327
Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Connectivity (05C40)
Related Items (4)
Radio graceful Hamming graphs ⋮ Further results on the radio number of trees ⋮ Radio number for the Cartesian product of two trees ⋮ Radio number of trees
This page was built for publication: The Radio numbers of all graphs of order $n$ and diameter $n-2$