Graph Labeling with Distance Conditions and the Delta Squared Conjecture
Combinatorics
2013-11-08 v3
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.
Cite
@article{arxiv.1309.0259,
title = {Graph Labeling with Distance Conditions and the Delta Squared Conjecture},
author = {Cole Franks},
journal= {arXiv preprint arXiv:1309.0259},
year = {2013}
}
Comments
24 pages, 5 figures