Professional Documents
Culture Documents
Myoung
Myoung
of Cm Cn .
Michael Young
Iowa State University
Exponential Domination
w (s, v ).
sD
Exponential Domination
Types of Domination
1. Domination:
1 if v N(u)
0 otherwise.
1 if v N(u)
0 otherwise.
w (u, v ) =
2. Total Domination:
w (u, v ) =
3. k-Domination:
1/k if v N(u)
1
if v = u
w (u, v ) =
0
otherwise.
Exponential Domination
An exponential dominating set of a graph G is a set D V (G ) such that
(D, w ) dominates G when w (u, v ) = ( 21 )dist(u,v )1 .
The exponential domination number of G , denoted by e (G ), is the
cardinality of a minimum exponential dominating set.
Exponential Domination
An exponential dominating set of a graph G is a set D V (G ) such that
(D, w ) dominates G when w (u, v ) = ( 21 )dist(u,v )1 .
The exponential domination number of G , denoted by e (G ), is the
cardinality of a minimum exponential dominating set.
Exponential Domination
Cm x Cn
Exponential Domination
Cm x Cn
Goal: Determine
e (Cm Cn )
.
mn
Exponential Domination
Naive Lower Bound:
Exponential Domination
Naive Lower Bound:
Let v V (Cm Cn ).
Exponential Domination
Naive Lower Bound:
Let v V (Cm Cn ).
There are at most 4d vertices that are distance d > 0 from v .
Exponential Domination
Naive Lower Bound:
Let v V (Cm Cn ).
There are at most 4d vertices that are distance d > 0 from v .
So w (v , V (Cm Cn )) 2 +
4d21d = 18.
d=1
Exponential Domination
Naive Lower Bound:
Let v V (Cm Cn ).
There are at most 4d vertices that are distance d > 0 from v .
So w (v , V (Cm Cn )) 2 +
4d21d = 18.
d=1
Therefore, mn
v D
Exponential Domination
Naive Lower Bound:
Let v V (Cm Cn ).
There are at most 4d vertices that are distance d > 0 from v .
So w (v , V (Cm Cn )) 2 +
4d21d = 18.
d=1
Therefore, mn
1
18
v D
e (Cm Cn )
.
mn
Exponential Domination
.
13
mn
Exponential Domination
+ o(1)
15.875
mn
13
.
Exponential Domination
Upper bound:
Exponential Domination
Proof of lower bound:
Exponential Domination
Theorem (BCDYY)
For all m, n 13,
e (Cm Cn )
1
,
13.7619 +
mn
where 0 as m, n .
Exponential Domination
x1
x2
x3 x4
x5
x8
Exponential Domination
1 dist(vi ,vj )
2
and
Exponential Domination
Theorem (BCDYY)
Let D be an exponential dominating set of Cm Cn and |D| be the
number of vertices in D that are not within a 7 7 grid of any other
vertex in D. Then
1
(Cm Cn )
,
13.7619 2.8218
mn
where 0 as m, n .
Future Directions
Prove
1
13 .
Thank You!