Title of article
Labeling the image-path with a condition at distance two Original Research Article
Author/Authors
John P. Georges، نويسنده , , David W. Mauro، نويسنده , , Yan Wang، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2009
Pages
13
From page
3203
To page
3215
Abstract
For integer image, the infinite image-path image is the graph on vertices image such that image is adjacent to image if and only if image. The image-path on image vertices is the subgraph of image induced by vertices image. For non-negative reals image and image, a image-labeling of a simple graph image is an assignment of non-negative reals to the vertices of image such that adjacent vertices receive reals that differ by at least image, vertices at distance two receive reals that differ by at least image, and the absolute difference between the largest and smallest assigned reals is minimized. With image denoting that minimum difference, we derive image for image, image, and image. For image, we obtain upper bounds on image and use them to give image for image and image. We also determine image and image for all image.
Keywords
rr-path , L(x1 , x2)L(x1 , x2)-labeling , ?x1 , x2-labeling , x2?x1 , ?x1 , x2?x1 , x2-number , Distance-constrained labeling
Journal title
Discrete Applied Mathematics
Serial Year
2009
Journal title
Discrete Applied Mathematics
Record number
887255
Link To Document