On the radio number of square of graphs

DOI10.1016/j.endm.2015.05.030zbMath1347.05078OpenAlexW830898738MaRDI QIDQ324962

Pratima Panigrahi, Laxman Saha

Publication date: 17 October 2016

Full work available at URL: https://doi.org/10.1016/j.endm.2015.05.030

zbMATH Keywords

channel assignment problemradio numberspanradio \(k\)-chromatic numberradio \(k\)-coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Channel models (including quantum) in information and communication theory (94A40)

Related Items (2)

Radio \(k\)-chromatic number of full \(m\)-ary trees ⋮ Relationship between radio k-chromatic number of graphs and square graphs

Cites Work

• A lower bound for radio \(k\)-chromatic number
• The Radio Number of $C_n \square C_n$
• ON RADIO NUMBER OF POWER OF CYCLES
• Radio numbers for generalized prism graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the radio number of square of graphs