Graph Labeling with Distance Conditions and the Delta Squared Conjecture

2013/09/01 by Franks, Cole
#05C78 #Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.1309.0259

Abstract

We give bounds on the L(2,1)-labeling number of a simple graph in terms of its order and its maximum degree. We also describe an infinite class of graphs of which the elements have the highest L(2,1)-labeling numbers in terms of their maximum degrees of any known infinite class of graphs.

Related

• A characterization of L(2, 1)-labeling number for trees with maximum degree 3
• The L(2, 1)-Labeling Problem on Oriented Regular Grids
• Distance two labeling of direct product of paths and cycles
• (2,1)-Total labeling of planar graphs with large maximum degree
• A note on distance labeling in planar graphs