Upper bound for radio k-chromatic number of graphs in connection with partition of vertex set

DOI10.1016/J.AKCEJ.2019.03.024zbMATH Open1473.05094OpenAlexW2931366625WikidataQ128107095 ScholiaQ128107095MaRDI QIDQ5154598FDOQ5154598

Authors: Laxman Saha 

Publication date: 5 October 2021

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

Full work available at URL: https://doi.org/10.1016/j.akcej.2019.03.024

Recommendations

• A lower bound for radio \(k\)-chromatic number
• An improved lower bound for the radio \(k\)-chromatic number of the hypercube qn
• A graph radio \(k\)-coloring algorithm
• A lower bound for radio \(k\)-chromatic number of an arbitrary graph
• Radio k-colorings of paths

zbMATH Keywords

channel assignment problemspanradio \(k\)-chromatic numberradio \(k\)-coloring

Mathematics Subject Classification ID

Applications of graph theory (05C90) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Radio labelings of graphs
• On the radio number of toroidal grids
• Title not available (Why is that?)
• Radio numbers for generalized prism graphs
• The radio antipodal and radio numbers of the hypercube.
• Title not available (Why is that?)
• Title not available (Why is that?)
• A lower bound for radio \(k\)-chromatic number
• Title not available (Why is that?)
• Multilevel Distance Labelings for Paths and Cycles
• An improved lower bound for the radio \(k\)-chromatic number of the hypercube qn
• Optimal radio labellings of complete \(m\)-ary trees
• Antipodal labelings for cycles.
• A lower bound technique for radio \(k\)-coloring
• Radio k-Labelings for Cartesian Products of Graphs

Cited In (11)

• A new graph parameter and a construction of larger graph without increasing radio \(k\)-chromatic number
• A graph radio \(k\)-coloring algorithm
• A new graph radio \(k\)-coloring algorithm
• Relationship between radio \(k\)-chromatic number of graphs and square graphs
• A lower bound for radio \(k\)-chromatic number
• An improved lower bound for the radio \(k\)-chromatic number of the hypercube qn
• Antipodal number of some powers of cycles
• On characterizing radio \(k\)-coloring problem by path covering problem
• A lower bound for radio \(k\)-chromatic number of an arbitrary graph
• Radio \(k\)-chromatic number of cycles for large \(k\)
• Radio \(k\)-chromatic number of full \(m\)-ary trees

This page was built for publication: Upper bound for radio \(k\)-chromatic number of graphs in connection with partition of vertex set

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