A lower bound for radio \(k\)-chromatic number

DOI10.1016/j.dam.2014.05.004zbMath1319.05056OpenAlexW2038453821MaRDI QIDQ491602

Laxman Saha, Pratima Panigrahi

Publication date: 18 August 2015

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

Full work available at URL: https://doi.org/10.1016/j.dam.2014.05.004

zbMATH Keywords

channel assignment problemradio numberspanradio \(k\)-chromatic numberradio \(k\)-coloringantipodal number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)

Related Items (17)

On the radio number of square of graphs ⋮ 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 ⋮ A new graph radio k-coloring algorithm ⋮ Triameter of graphs ⋮ Optimal radio labellings of block graphs and line graphs of trees ⋮ Antipodal number of full \(m\)-ary trees ⋮ Upper bound for radio -chromatic number of graphs in connection with partition of vertex set ⋮ A lower bound technique for radio \(k\)-coloring ⋮ Radio $k$-labeling of paths ⋮ A new graph parameter and a construction of larger graph without increasing radio \(k\)-chromatic number ⋮ Antipodal radio labelling of full binary trees ⋮ A note on the triameter 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

• Antipodal number of some powers of cycles
• 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 number for trees
• The Radio Number of $C_n \square C_n$
• Radio numbers for generalized prism graphs
• Nearly antipodal chromatic number $ac'(P_n)$ of the path $P_n$
• Labelling Graphs with a Condition at Distance 2
• Multilevel Distance Labelings for Paths and Cycles
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A lower bound for radio \(k\)-chromatic number