2-dipath and oriented L(2, 1)-labelings of some families of oriented planar graphs

Sagnik Sen Supervisors:

Prof. ric Sopena, Prof. Andr Raspaud, Prof. Arnaud Pcher LaBRI, Universit de Bordeaux 1

31/08/2011

Sagnik Sen

2-dipath and oriented L(2, 1)-labelings of some families of oriented

Basic denitions
Denition A k-L(2, 1)-labeling of a graph G is a function from the vertex set V (G) to the set {0, 1, ...., k } such that - | (u ) (v ) | 2 if u and v are at distance 1 in G, - | (u ) (v ) | 1 if u and v are at distance 2 in G.

Sagnik Sen

2-dipath and oriented L(2, 1)-labelings of some families of oriented

Basic denitions
Denition A k-L(2, 1)-labeling of a graph G is a function from the vertex set V (G) to the set {0, 1, ...., k } such that - | (u ) (v ) | 2 if u and v are at distance 1 in G, - | (u ) (v ) | 1 if u and v are at distance 2 in G. Span 2,1 (G) = min{k | G has a k -L(2, 1)-labeling }.

Sagnik Sen

2-dipath and oriented L(2, 1)-labelings of some families of oriented

Basic denitions
Denition A k-L(2, 1)-labeling of a graph G is a function from the vertex set V (G) to the set {0, 1, ...., k } such that - | (u ) (v ) | 2 if u and v are at distance 1 in G, - | (u ) (v ) | 1 if u and v are at distance 2 in G. Span 2,1 (G) = min{k | G has a k -L(2, 1)-labeling }. 6

5 4 3

8 7 2

Figure: Star
Sagnik Sen

2-dipath and oriented L(2, 1)-labelings of some families of oriented

Basic denitions
Denition A 2-dipath k-L(2, 1)-labeling of an oriented graph G is a function from the vertex set V (G) to the set {0, 1, ...., k } such that - | (u ) (v ) | 2 if u and v are adjacent in G, - | (u ) (v ) | 1 if u and v are connected by a directed 2-path in G. 2-dipath span 2,1 (G) = min{k | G has a 2-dipath k -L(2, 1)-labeling }.

Sagnik Sen

2-dipath and oriented L(2, 1)-labelings of some families of oriented

Basic denitions
Denition A 2-dipath k-L(2, 1)-labeling of an oriented graph G is a function from the vertex set V (G) to the set {0, 1, ...., k } such that - | (u ) (v ) | 2 if u and v are adjacent in G, - | (u ) (v ) | 1 if u and v are connected by a directed 2-path in G. 2-dipath span 2,1 (G) = min{k | G has a 2-dipath k -L(2, 1)-labeling }. 2

3 2 2
Sagnik Sen

3 3 3

2-dipath and oriented L(2, 1)-labelings of some families of oriented Figure: Star

Basic denitions
Denition A homomorphism f of an oriented graph G to an oriented graph H is a mapping f : V (G) V (H ) such that xy A(G) implies f (x )f (y ) V (H ).

Sagnik Sen

2-dipath and oriented L(2, 1)-labelings of some families of oriented

Basic denitions
Denition A homomorphism f of an oriented graph G to an oriented graph H is a mapping f : V (G) V (H ) such that xy A(G) implies f (x )f (y ) V (H ).

3 2 2

3 3 3
Figure: Homomorphism

Sagnik Sen

2-dipath and oriented L(2, 1)-labelings of some families of oriented

Basic denitions

Denition A homomorphism f of an oriented graph G to an oriented graph H is a mapping f : V (G) V (H ) such that xy A(G) implies f (x )f (y ) V (H ). Denition A proper oriented k-coloring of G is is a function f from the vertex set V (G) to the set {0, 1, ...., k 1} such that - uv A( G ) implies, f (u ) = f (v ). - If xy and uv are two arcs in G then, f (x ) = f (v ) implies f (y ) = f (u ).

Sagnik Sen

2-dipath and oriented L(2, 1)-labelings of some families of oriented

Basic denitions

Denition An oriented k-L(2, 1)-labeling of an oriented graph G is a function from the vertex set V (G) to the set {0, 1, ...., k } such that - is a 2-dipath k-L(2, 1)-labeling of G, - If xy and uv are two arcs in G then, (x ) = (v ) implies (y ) = (u ).

Sagnik Sen

2-dipath and oriented L(2, 1)-labelings of some families of oriented

Basic denitions

Denition An oriented k-L(2, 1)-labeling of an oriented graph G is a function from the vertex set V (G) to the set {0, 1, ...., k } such that - is a 2-dipath k-L(2, 1)-labeling of G, - If xy and uv are two arcs in G then, (x ) = (v ) implies (y ) = (u ). Oriented span o 2,1 (G) = min{k | G has an oriented k -L(2, 1)-labeling }.

Sagnik Sen

2-dipath and oriented L(2, 1)-labelings of some families of oriented

Basic results

Lemma 2,1 (G) o 2,1 (G)

Sagnik Sen

2-dipath and oriented L(2, 1)-labelings of some families of oriented

Basic results

Lemma 2,1 (G) o 2,1 (G)

Lemma
o If there is a homomorphism f : G H then o 2,1 (G) 2,1 (H ).

Sagnik Sen

2-dipath and oriented L(2, 1)-labelings of some families of oriented

The existing results (Calamoneri and Sinaimeri (2010))

Conjecture 2,1 (P5 ) = 5.

Sagnik Sen

2-dipath and oriented L(2, 1)-labelings of some families of oriented

The existing results (Calamoneri and Sinaimeri (2010))

Conjecture 2,1 (P5 ) = 5.

Theorem 2,1 (P11 ) 12.

Sagnik Sen

2-dipath and oriented L(2, 1)-labelings of some families of oriented

The existing results (Calamoneri and Sinaimeri (2010))

Conjecture 2,1 (P5 ) = 5.

Theorem 2,1 (P11 ) 12.

Theorem 2,1 (P16 ) 8.

Sagnik Sen

2-dipath and oriented L(2, 1)-labelings of some families of oriented

The existing results (Calamoneri and Sinaimeri (2010))

Conjecture 2,1 (P5 ) = 5.

Theorem 2,1 (P11 ) 12.

Theorem 2,1 (P16 ) 8.

Theorem 6 2,1 (C ) 8.
Sagnik Sen

2-dipath and oriented L(2, 1)-labelings of some families of oriented

Our improvements
Theorem 6 2,1 (P5 ). Theorem 2,1 (P11 ) 12. Theorem 2,1 (P16 ) 8. Theorem 6 2,1 (C ) 8.

Sagnik Sen

2-dipath and oriented L(2, 1)-labelings of some families of oriented

Our improvements
Theorem 6 2,1 (P5 ). Theorem 2,1 (P11 ) o 2,1 (P11 ) 10. Theorem 2,1 (P16 ) 8. Theorem 6 2,1 (C ) 8.

Sagnik Sen

2-dipath and oriented L(2, 1)-labelings of some families of oriented

Our improvements
Theorem 6 2,1 (P5 ). Theorem 2,1 (P11 ) o 2,1 (P11 ) 10. Theorem 2,1 (P16 ) o 2,1 (P16 ) 7. Theorem 6 2,1 (C ) 8.

Sagnik Sen

2-dipath and oriented L(2, 1)-labelings of some families of oriented

Our improvements
Theorem 6 2,1 (P5 ). Theorem 2,1 (P11 ) o 2,1 (P11 ) 10. Theorem 2,1 (P16 ) o 2,1 (P16 ) 7. Theorem 2,1 (C ) = o p,q (C ) = 7.

Sagnik Sen

2-dipath and oriented L(2, 1)-labelings of some families of oriented

The existing results (Calamoneri and Sinaimeri (2010))

Theorem 8 2,1 (H) 10.

Sagnik Sen

2-dipath and oriented L(2, 1)-labelings of some families of oriented

The existing results (Calamoneri and Sinaimeri (2010))

Theorem 8 2,1 (H) 10.

Theorem 8 2,1 (W ) 9.

Sagnik Sen

2-dipath and oriented L(2, 1)-labelings of some families of oriented

Halin graph

Theorem 8 2,1 (H) 10. Theorem 2,1 (W ) = 8.

Sagnik Sen

2-dipath and oriented L(2, 1)-labelings of some families of oriented

Halin graph

Theorem 8 2,1 (H) 10. Theorem 2,1 (W ) = 8.

Theorem 7 2,1 (Hli ) 8.

Sagnik Sen

2-dipath and oriented L(2, 1)-labelings of some families of oriented

A 4-Nice graph

7 6

0 1

5 4 3

Figure: B is a 4-nice graph.

Sagnik Sen

2-dipath and oriented L(2, 1)-labelings of some families of oriented

Cactus (lower bound proof)

x=2

Figure: The cactus H .

Sagnik Sen

2-dipath and oriented L(2, 1)-labelings of some families of oriented

Thank you

Thank you for your attention.

Sagnik Sen

2-dipath and oriented L(2, 1)-labelings of some families of oriented