L(2,1)-labeling of the strong product of paths and cycles
Povzetek
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.
Ključne besede
matematika;teorija grafov;označitev točk;mathematics;graph theory;
Podatki
| Jezik: | Angleški jezik |
|---|---|
| Leto izida: | 2014 |
| Tipologija: | 1.01 - Izvirni znanstveni članek |
| Organizacija: | UM FNM - Fakulteta za naravoslovje in matematiko |
| UDK: | 519.17 |
| COBISS: |
20366088
|
| ISSN: | 1537-744X |
| Št. ogledov: | 755 |
| Št. prenosov: | 296 |
| Ocena: | 0 (0 glasov) |
| Metapodatki: |
|
Ostali podatki
| Sekundarni jezik: | Slovenski jezik |
|---|---|
| Sekundarne ključne besede: | matematika;teorija grafov;označitev točk; |
| URN: | URN:SI:UM: |
| Vrsta dela (COBISS): | Znanstveno delo |
| Strani: | str. 1-12 |
| Letnik: | ǂVol. ǂ2014 |
| Zvezek: | ǂart. ID ǂ741932 |
| Čas izdaje: | 2014 |
| DOI: | 10.1155/2014/741932 |
| ID: | 10842814 |
Priporočena dela:
L(2,1)-labeling of the strong product of paths and cycles
2014,
ni podatka o podnaslovu
Many distances in planar graphs
2009,
ni podatka o podnaslovu
Crossing number additivity over edge cuts
2013,
ni podatka o podnaslovu
On Vizing's conjecture
2001,
ni podatka o podnaslovu
NZ-flows in strong products of graphs
2010,
ni podatka o podnaslovu