Improved bounds for radio \(k\)-chromatic number of hypercube \(Q_{n}\)
From MaRDI portal
Publication:539413
DOI10.1155/2011/961649zbMath1217.05094OpenAlexW2042843122WikidataQ58688000 ScholiaQ58688000MaRDI QIDQ539413
Pawan Kumar, Laxman Saha, Pratima Panigrahi
Publication date: 27 May 2011
Published in: International Journal of Mathematics and Mathematical Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2011/961649
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An improved lower bound for the radio \(k\)-chromatic number of the hypercube qn
- On radio \((n-4)\)-chromatic number of the path \(P_n\)
- Optimal radio labellings of complete \(m\)-ary trees
- Radio k-Labelings for Cartesian Products of Graphs
- Nearly antipodal chromatic number $ac'(P_n)$ of the path $P_n$
- Multilevel Distance Labelings for Paths and Cycles