L(2,1)-labeling of the strong product of paths and cycles
Abstract
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 Pn ☒ Cm and for n ≤ 11 the ƛ-number of Cn ☒ Cm. 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 Cn ☒ Cm, m ≥ 24 and n ≥ 26.
Keywords
matematika;teorija grafov;označitev točk;mathematics;graph theory;
Data
| Language: | English |
|---|---|
| Year of publishing: | 2014 |
| Typology: | 1.01 - Original Scientific Article |
| Organization: | UM FNM - Faculty of Natural Sciences and Mathematics |
| UDC: | 519.17 |
| COBISS: |
20366088
|
| ISSN: | 1537-744X |
| Views: | 755 |
| Downloads: | 296 |
| Average score: | 0 (0 votes) |
| Metadata: |
|
Other data
| Secondary language: | Slovenian |
|---|---|
| Secondary keywords: | matematika;teorija grafov;označitev točk; |
| URN: | URN:SI:UM: |
| Type (COBISS): | Scientific work |
| Pages: | str. 1-12 |
| Volume: | ǂVol. ǂ2014 |
| Issue: | ǂart. ID ǂ741932 |
| Chronology: | 2014 |
| DOI: | 10.1155/2014/741932 |
| ID: | 10842814 |
Recommended works:
L(2,1)-labeling of the strong product of paths and cycles
2014,
no subtitle data available
Many distances in planar graphs
2009,
no subtitle data available
Crossing number additivity over edge cuts
2013,
no subtitle data available
On Vizing's conjecture
2001,
no subtitle data available
NZ-flows in strong products of graphs
2010,
no subtitle data available