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

DOI10.1080/09728600.2021.1993730MaRDI QIDQ5861707zbMATH OpenOpenAlexFDO

Authors Laxman Saha

Publication date 2 March 2022

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

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

frequency assignment problemradio \(k\)-labelingradio \(k\)-numberspansquare of graphs

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 5850548
• On the radio number of square of graphs
• A lower bound for radio \(k\)-chromatic number
• Radio k-chromatic number of cycles for large k
• scientific article; zbMATH DE number 2170463

Cites work

• A graph radio k-coloring algorithm
• A lower bound for radio \(k\)-chromatic number
• A lower bound technique for radio k-coloring
• A note on radio antipodal colourings of paths.
• Algorithmic aspects in information and management. 14th international conference, AAIM 2020, Jinhua, China, August 10--12, 2020. Proceedings
• Antipodal labelings for cycles.
• Antipodal number of full \(m\)-ary trees
• scientific article; zbMATH DE number 5850548 (Why is no real title available?)
• Improved lower bounds for the radio number of trees
• Multilevel Distance Labelings for Paths and Cycles
• On radio number of power of cycles
• On the radio number of square of graphs
• On the radio number of toroidal grids
• Optimal radio labellings of complete m-ary trees
• Optimal radio-\(k\)-labelings of trees
• Radio \(k\)-labeling of paths
• Radio antipodal colorings of cycles
• Radio labelings of graphs
• Radio number for trees
• Radio numbers for generalized prism graphs
• The radio antipodal and radio numbers of the hypercube.
• The radio number of \(C_n\square C_n\).
• Upper bound for radio k-chromatic number of graphs in connection with partition of vertex set
• Upper bounds on the radio number of some trees

Cited in

(1)

• On the radio number of square of graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5861707)