L ( 2,1 ) -Labeling of the Strong Product of Paths and Cycles
Joint Authors
Source
Issue
Vol. 2014, Issue 2014 (31 Dec. 2014), pp.1-12, 12 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2014-02-24
Country of Publication
Egypt
No. of Pages
12
Main Subjects
Medicine
Information Technology and Computer Science
Abstract EN
An L ( 2,1 ) -labeling of a graph G = ( V , E ) is a function f from the vertex set V ( G ) to the set of nonnegative integers such that the labels on adjacent vertices differ by at least two and the labels on vertices at distance two differ by at least one.
The span of f is the difference between the largest and the smallest numbers in f ( V ) .
The λ -number of G , denoted by λ ( G ) , is the minimum span over all L ( 2,1 ) -labelings of G .
We consider the λ -number of P n ⊠ C m and for n ≤ 11 the λ -number of C n ⊠ C m .
We determine λ -numbers of graphs of interest with the exception of a finite number of graphs and we improve the bounds on the λ -number of C n ⊠ C m , m ≥ 24 and n ≥ 26 .
American Psychological Association (APA)
Shao, Zehui& Vesel, Aleksander. 2014. L ( 2,1 ) -Labeling of the Strong Product of Paths and Cycles. The Scientific World Journal،Vol. 2014, no. 2014, pp.1-12.
https://search.emarefa.net/detail/BIM-1050858
Modern Language Association (MLA)
Shao, Zehui& Vesel, Aleksander. L ( 2,1 ) -Labeling of the Strong Product of Paths and Cycles. The Scientific World Journal No. 2014 (2014), pp.1-12.
https://search.emarefa.net/detail/BIM-1050858
American Medical Association (AMA)
Shao, Zehui& Vesel, Aleksander. L ( 2,1 ) -Labeling of the Strong Product of Paths and Cycles. The Scientific World Journal. 2014. Vol. 2014, no. 2014, pp.1-12.
https://search.emarefa.net/detail/BIM-1050858
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-1050858