Radio numbers of certain \(m\)-distant trees

DOI10.1155/2014/486354zbMath1309.05063OpenAlexW2122250483WikidataQ59049566 ScholiaQ59049566MaRDI QIDQ2018964

Pratima Panigrahi, Srinivasa Rao Kola

Publication date: 26 March 2015

Published in: Journal of Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2014/486354

zbMATH Keywords

radio numberradio coloringcaterpillars

Mathematics Subject Classification ID

Trees (05C05) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12)

Related Items (1)

On the radio \(k\)-chromatic number of some classes of trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An improved lower bound for the radio \(k\)-chromatic number of the hypercube qn
• A survey on radio \(k\)-colorings of graphs
• Optimal radio labellings of complete \(m\)-ary trees
• Radio number for trees
• Linear and cyclic radio k-labelings of trees
• Multilevel Distance Labelings for Paths and Cycles

This page was built for publication: Radio numbers of certain \(m\)-distant trees