Antipodal number of some powers of cycles

DOI10.1016/j.disc.2011.10.032zbMath1239.05074OpenAlexW1964892002MaRDI QIDQ411663

Pratima Panigrahi, Laxman Saha

Publication date: 30 April 2012

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

Full work available at URL: https://doi.org/10.1016/j.disc.2011.10.032

zbMATH Keywords

channel assignment problemspanradio \(k\)-chromatic numberradio \(k\)-coloringantipodal number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (9)

Hole: An Emerging Character in the Story of Radio k-Coloring Problem ⋮ Radio graceful Hamming graphs ⋮ Radio k-chromatic number of cycles for large k ⋮ Radio labelings of distance graphs ⋮ Triameter of graphs ⋮ On characterizing radio \(k\)-coloring problem by path covering problem ⋮ A lower bound for radio \(k\)-chromatic number ⋮ A new graph parameter and a construction of larger graph without increasing radio \(k\)-chromatic number ⋮ A note on the triameter of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An improved lower bound for the radio \(k\)-chromatic number of the hypercube qn
• On radio \((n-4)\)-chromatic number of the path \(P_n\)
• Optimal radio labellings of complete \(m\)-ary trees
• Radio k-labelings for Cartesian products of graphs
• Nearly antipodal chromatic number $ac'(P_n)$ of the path $P_n$
• Multilevel Distance Labelings for Paths and Cycles

This page was built for publication: Antipodal number of some powers of cycles