Radio numbers for generalized prism graphs

DOI10.7151/DMGT.1529MaRDI QIDQ3171417zbMATH OpenOpenAlexFDO

Authors Paul Martinez, Maggy Tomova, Cindy Wyels, 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)

Abstract: A radio labeling is an assignment $c:V(G)ightarrowextbfN$ such that every distinct pair of vertices $u,v$ satisfies the inequality $d(u,v)+|c(u)-c(v)|geqdiam(G)+1$. The span of a radio labeling is the maximum value. The radio number of $G$, $rn(G)$, is the minimum span over all radio labelings of $G$. Generalized prism graphs, denoted $Z_{n,s}$, $sgeq1$, $ngeqs$, have vertex set $(i,j),|,i=1,2extandj=1,\mathrm{...},n$ and edge set $((i,j),(i,jpm1))cup((1,i),(2,i+sigma)),|,sigma=-leftlfloorfracs-12ightfloor,ldots,0,ldots,leftlfloorfracs2ightfloor$. In this paper we determine the radio number of $Z_{n,s}$ for $s=1,2$ and $3$. In the process we develop techniques that are likely to be of use in determining radio numbers of other families of graphs.

Recommendations

• Radio labeling and radio number for generalized caterpillar graphs
• scientific article; zbMATH DE number 2188457
• Radio number of graphs of diameter three
• scientific article; zbMATH DE number 2154968
• Achieving all radio numbers

Cited in

(17)

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

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

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