Domination versus edge domination

Abstract: We propose the conjecture that the domination number

g a m m a (G)

of a

D e l t a

-regular graph

G

with

D e l t a g e q 1

is always at most its edge domination number

g a m m a_{e} (G)

, which coincides with the domination number of its line graph. We prove that

g a m m a (G) l e q l e f t (1 + f r a c 2 (D e l t a - 1) D e l t a 2^{D e l t a} i g h t) g a m m a_{e} (G)

for general

D e l t a g e q 1

, and

g a m m a (G) l e q l e f t (f r a c 76 - f r a c 1204 i g h t) g a m m a_{e} (G)

for

D e l t a = 3

. Furthermore, we verify our conjecture for cubic claw-free graphs.

Recommendations

Cites Work

Cited In (10)

This page was built for publication: Domination versus edge domination