Radio labelings of distance graphs

DOI10.1016/J.DAM.2013.06.024MaRDI QIDQ2446877zbMATH OpenOpenAlexFDO

Authors Roman Čada, Jan Ekstein, Přemysl Holub, Olivier Togni

Publication date 23 April 2014

Published in Discrete Applied Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

distance graphgraph labelingradio \(k\)-labeling number

Mathematics Subject Classification ID

Distance in graphs (05C12) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Channel models (including quantum) in information and communication theory (94A40)

Abstract: A radio $k$-labeling of a connected graph $G$ is an assignment $c$ of non negative integers to the vertices of $G$ such that ${\displaystyle }$|c(x) - c(y)| geq k+1 - d(x,y),${\displaystyle }$ for any two vertices $x$ and $y$, $xey$, where $d(x,y)$ is the distance between $x$ and $y$ in $G$. In this paper, we study radio labelings of distance graphs, i.e., graphs with the set $$ of integers as vertex set and in which two distinct vertices $$ are adjacent if and only if $|i-j|inD$.

Recommendations

• New results on radio \(k\)-labelings of distance graphs
• scientific article; zbMATH DE number 2154968
• Radio labelings of graphs
• Radio k-labelings for Cartesian products of graphs
• Linear and cyclic radio k-labelings of trees

Cites work

• A Combinatorial Problem Related to Multimodule Memory Organizations
• A survey on radio \(k\)-colorings of graphs
• Antipodal number of some powers of cycles
• Colouring the real line
• Connectivity and diameter in distance graphs
• scientific article; zbMATH DE number 5850548 (Why is no real title available?)
• scientific article; zbMATH DE number 2170463 (Why is no real title available?)
• Labelling Graphs with a Condition at Distance 2
• Linear and cyclic radio k-labelings of trees
• Multilevel Distance Labelings for Paths and Cycles
• On L(2,1)-labellings of distance graphs
• On packing colorings of distance graphs
• Radio antipodal colorings of cycles
• Radio antipodal colorings of graphs
• Radio k-colorings of paths
• Radio k-labelings for Cartesian products of graphs
• Radio labelings of graphs
• Radio number for trees
• Radio numbers for generalized prism graphs
• The upper traceable number of a graph

Cited in

(16)

• Radio and radial radio numbers of certain sunflower extended graphs
• New results on radio \(k\)-labelings of distance graphs
• Further results on the radio number of trees
• Distance three labellings for \(K _n\times K_2\)
• Radio k-Labelings for Cartesian Products of Graphs
• Radio k-labelings for Cartesian products of graphs
• Radio Graceful Labelling of Graphs
• Radio \(k\)-labeling of paths
• Radio k-chromatic number of cycles for large k
• Linear and cyclic radio k-labelings of trees
• Radio number of trees
• On radio k-labeling of the power of the infinite path
• Radio number for the Cartesian product of two trees
• On \(\lambda\)-backbone coloring of cliques with tree backbones in linear time
• A linear algorithm for radio k-coloring of powers of paths having small diameters
• Optimal radio labelings of the Cartesian product of the generalized Peterson graph and tree

This page was built for publication: Radio labelings of distance graphs

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