The L(2,1)-Labeling of Some Middle Graphs
An (2,1) L -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 if d(x,y) = 2. The L(2,1) -labeling number λ(G) of G is the smallest number k such that G has an L(2,1)-labeling w...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Stefan cel Mare University of Suceava
2010-01-01
|
| Series: | Journal of Applied Computer Science & Mathematics |
| Subjects: | |
| Online Access: | http://jacs.usv.ro/getpdf.php?issue=9&paperid=918 |
| Summary: | An (2,1) L -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 if d(x,y) = 2. 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). In this paper we completely determine λ-number for middle graph of path P<sub>n</sub>, cycle C<sub>n</sub> , star K<sub>1,n</sub> , friendship graph F<sub>n</sub> and wheel W<sub>n</sub>. |
|---|---|
| ISSN: | 2066-4273 2066-3129 |