ON RADIO NUMBER OF POWER OF CYCLES

DOI10.1142/S1793557111000435zbMath1242.05101OpenAlexW1980380726MaRDI QIDQ2891032

Pawan Kumar, Laxman Saha, Pratima Panigrahi

Publication date: 12 June 2012

Published in: Asian-European Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793557111000435

zbMATH Keywords

channel assignmentradio numberspanradio coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (4)

On the radio number of square of graphs ⋮ Radio \(k\)-chromatic number of full \(m\)-ary trees ⋮ Radio fuzzy graphs and assignment of frequency in radio stations ⋮ Relationship between radio k-chromatic number of graphs and square graphs

Cites Work

• An improved lower bound for the radio \(k\)-chromatic number of the hypercube qn
• Optimal radio labellings of complete \(m\)-ary trees
• Radio k-Labelings for Cartesian Products of Graphs
• Linear and cyclic radio k-labelings of trees
• Multilevel Distance Labelings for Paths and Cycles

This page was built for publication: ON RADIO NUMBER OF POWER OF CYCLES