Radio numbers for generalized prism graphs

DOI10.7151/dmgt.1529zbMath1284.05240arXiv1007.5346OpenAlexW2123348176MaRDI QIDQ3171417

Cindy Wyels, Paul Martinez, Maggy Tomova, Juan Carlos Ortiz

Publication date: 5 October 2011

Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1007.5346

zbMATH Keywords

radio labelingradio numberprism graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (16)

Radio-\(k\)-labeling of cycles for large \(k\) ⋮ On the radio number of square of graphs ⋮ Radio graceful Hamming graphs ⋮ DVcube: a novel compound architecture of disc-ring graph and hypercube-like graph ⋮ Radio number for the Cartesian product of two trees ⋮ A new graph radio k-coloring algorithm ⋮ Radio labelings of distance graphs ⋮ Improved lower bounds for the radio number of trees ⋮ Optimal radio-\(k\)-labelings of trees ⋮ A lower bound for radio \(k\)-chromatic number ⋮ Optimal radio labellings of block graphs and line graphs of trees ⋮ Antipodal number of full \(m\)-ary trees ⋮ Upper bound for radio -chromatic number of graphs in connection with partition of vertex set ⋮ Radio $k$-labeling of paths ⋮ Radio \(k\)-chromatic number of full \(m\)-ary trees ⋮ Relationship between radio k-chromatic number of graphs and square graphs

This page was built for publication: Radio numbers for generalized prism graphs