Mathematica Bohemica · 2005 · 44 citations · 4 references
Natural SciencesComputer ScienceMathematicsAlgorithmsCombinatoricsDiscrete MathematicsCombinatorial Number TheoryGraph ColoringGraph LabelingGraph TheoryNetwork DiameterChromatic PolynomialsColoring TheoremsExact Graph ColoringRadio Labeling
The radio antipodal number of a graph $G$ is the smallest integer $c$ such that there exists an assignment $f\: V(G)\rightarrow \lbrace 1,2,\ldots ,c\rbrace $ satisfying $|f(u)-f(v)|\ge D-d(u,v)$ for every two distinct vertices $u$ and $v$ of $G$, where $D$ is the diameter of $G$. In this note we determine the exact value of the antipodal number of the path, thus answering the conjecture given in [G. Chartrand, D. Erwin and P. Zhang, Math. Bohem. 127 (2002), 57–69]. We also show the connections between this colouring and radio labelings.
4
Gary Chartrand, Ladislav Nebeský, Ping Zhang · Discussiones Mathematicae Graph Theory · 2004 · 39 citations
Radio antipodal colorings of graphs
Gary Chartrand, David Erwin, Ping Zhang · Mathematica Bohemica · 2002 · 32 citations · Full text