Graph Labeling with Distance Conditions and the Delta Squared Conjecture
classification
🧮 math.CO
keywords
labelingclassgraphgraphsinfinitemaximumtermsbounds
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.