The radio k-chromatic number for the corona of arbitrary graph and K₁

DOI10.1007/978-981-19-9307-7_15MaRDI QIDQ6629111zbMATH OpenFDO

Authors P. K. Niranjan

Publication date 29 October 2024

zbMATH Keywords

radio numbergraph operationspanradio \(k\)-chromatic numberradio \(k\)-coloringradio coloringcorona of graphs

Mathematics Subject Classification ID

Numerical analysis (65-XX)

Cites work

• A lower bound for radio \(k\)-chromatic number of an arbitrary graph
• A lower bound technique for radio \(k\)-coloring
• An improved lower bound for the radio \(k\)-chromatic number of the hypercube qn
• Labelling Graphs with a Condition at Distance 2
• Linear and cyclic radio k-labelings of trees
• Multilevel Distance Labelings for Paths and Cycles
• On \(L(2,1)\)-labelings of Cartesian products of paths and cycles
• On bounds of radio number of certain product graphs
• On irreducible no-hole \(L(2, 1)\)-coloring of Cartesian product of trees with paths
• On the irreducible no-hole \(L(2,1)\) coloring of bipartite graphs and Cartesian products
• On the radio number for corona of paths and cycles
• On the radio number of toroidal grids
• Radio k-labelings for Cartesian products of graphs
• Radio labelings of graphs
• Radio number for the product of a path and a complete graph
• The radio number of \(C_n\square C_n\).
• \(L(2, 1)\)-labeling of permutation and bipartite permutation graphs
• \(L(2,1)\)-colorings and irreducible no-hole colorings of Cartesian product of graphs
• \(L(2,1)\)-labeling of interval graphs

This page was built for publication: The radio \(k\)-chromatic number for the corona of arbitrary graph and \(K_1\)

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