Relationship between radio k-chromatic number of graphs and square graphs

DOI10.1080/09728600.2021.1993730zbMath1483.05145OpenAlexW3211209361MaRDI QIDQ5861707

Laxman Saha

Publication date: 2 March 2022

Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/09728600.2021.1993730

zbMATH Keywords

frequency assignment problemspansquare of graphsradio \(k\)-labelingradio \(k\)-number

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the radio number of square of graphs
• A lower bound for radio \(k\)-chromatic number
• A lower bound technique for radio \(k\)-coloring
• Optimal radio labellings of complete \(m\)-ary trees
• Antipodal number of full \(m\)-ary trees
• Algorithmic aspects in information and management. 14th international conference, AAIM 2020, Jinhua, China, August 10--12, 2020. Proceedings
• Improved lower bounds for the radio number of trees
• Optimal radio-\(k\)-labelings of trees
• Radio number for trees
• The Radio Number of $C_n \square C_n$
• A Graph Radio k-Coloring Algorithm
• ON RADIO NUMBER OF POWER OF CYCLES
• Radio numbers for generalized prism graphs
• Upper bound for radio -chromatic number of graphs in connection with partition of vertex set
• Radio $k$-labeling of paths
• Multilevel Distance Labelings for Paths and Cycles

This page was built for publication: Relationship between radio k-chromatic number of graphs and square graphs