Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/22670
Title: The L (2, 1)-labeling on the skew and converse skew products of graphs
Authors: Shao, Z
Yeh, RK
Zhang, D 
Keywords: Channel assignment
Graph converse skew product
Graph skew product
L (2, 1)-labeling
Issue Date: 2007
Publisher: Pergamon Press
Source: Applied mathematics letters, 2007, v. 20, no. 1, p. 59-64 How to cite?
Journal: Applied mathematics letters 
Abstract: An L (2, 1)-labeling of a graph G is a function f from the vertex set V (G) to the set of all nonnegative integers such that | f (x) - f (y) | ≥ 2 if d (x, y) = 1 and | f (x) - f (y) | ≥ 1 if d (x, y) = 2, where d (x, y) denotes the distance between x and y in G. The L (2, 1)-labeling number λ (G) of G is the smallest number k such that G has an L (2, 1)-labeling with max {f (v) : v ∈ V (G)} = k. Griggs and Yeh conjecture that λ (G) ≤ Δ2 for any simple graph with maximum degree Δ ≥ 2. This work considers the graph formed by the skew product and the converse skew product of two graphs. As corollaries, the new graph satisfies the above conjecture (with minor exceptions).
URI: http://hdl.handle.net/10397/22670
ISSN: 0893-9659
DOI: 10.1016/j.aml.2006.02.032
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

2
Last Week
0
Last month
0
Citations as of Oct 6, 2018

WEB OF SCIENCETM
Citations

2
Last Week
0
Last month
0
Citations as of Oct 19, 2018

Page view(s)

70
Last Week
1
Last month
Citations as of Oct 15, 2018

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.