The radio k-chromatic number for the corona of arbitrary graph and K₁
From MaRDI portal
Publication:6629111
DOI10.1007/978-981-19-9307-7_15MaRDI QIDQ6629111FDOQ6629111
Authors: P. K. Niranjan 
Publication date: 29 October 2024
radio numbergraph operationspanradio \(k\)-chromatic numberradio \(k\)-coloringradio coloringcorona of graphs
Cites Work
- On \(L(2,1)\)-labelings of Cartesian products of paths and cycles
- Labelling Graphs with a Condition at Distance 2
- 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
- \(L(2,1)\)-labeling of interval graphs
- Linear and cyclic radio k-labelings of trees
- Multilevel Distance Labelings for Paths and Cycles
- An improved lower bound for the radio \(k\)-chromatic number of the hypercube qn
- \(L(2, 1)\)-labeling of permutation and bipartite permutation graphs
- A lower bound technique for radio \(k\)-coloring
- A lower bound for radio \(k\)-chromatic number of an arbitrary graph
- 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
- Radio number for the product of a path and a complete graph
- \(L(2,1)\)-colorings and irreducible no-hole colorings of Cartesian product of graphs
- On irreducible no-hole \(L(2, 1)\)-coloring of Cartesian product of trees with paths
- On bounds of radio number of certain product 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)
