The radio \(k\)-chromatic number for corona of graphs

DOI10.1142/S1793557123500560MaRDI QIDQ6650317

Srinivasa Rao Kola, P. K. Niranjan

Publication date: 9 December 2024

Published in: Asian-European Journal of Mathematics (Search for Journal in Brave)

zbMATH Keywords

radio numberradio \(k\)-chromatic numberradio \(k\)-coloringradio coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A lower bound technique for radio \(k\)-coloring
• An improved lower bound for the radio \(k\)-chromatic number of the hypercube qn
• Radio number for the product of a path and a complete graph
• Radio labelings of graphs
• The radio number of \(C_n\square C_n\).
• On the radio number of toroidal grids
• Radio k-labelings for Cartesian products of graphs
• Labelling Graphs with a Condition at Distance 2
• On the radio number for corona of paths and cycles
• Linear and cyclic radio k-labelings of trees
• Multilevel Distance Labelings for Paths and Cycles

This page was built for publication: The radio \(k\)-chromatic number for corona of graphs

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