Total domination in cubic Knodel graphs

Publication date 9 September 2021

Abstract: A subset

D

of vertices of a graph

G

is a extit{dominating set} if for each

u i n V (G) s e t m i n u s D

,

u

is adjacent to some vertex

v i n D

. The extit{dominating number},

g a m m a (G)

of

G

, is the minimum cardinality of a dominating set of

G

. A set

D s u b s e t e q V (G)

is a extit{total dominating set} if for each

u i n V (G)

,

u

is adjacent to some vertex

v i n D

. the The extit{total dominating number},

g a m m a_{t} (G)

of

G

, is the minimum cardinality of a total dominating set of

G

. For an even integer

n g e 2

and

1 l e D e l t a l e l f l o o r l o g_{2} n f l o o r

, a extit{Kn"odel graph}

W_{D e l t a, n}

is a

D e l t a

-regular bipartite graph of even order

n

, with vertices

(i, j)

, for

i = 1, 2

and

0 l e j l e n / 2 - 1

, where for every

j

,

0 l e j l e n / 2 - 1

,there is an edge between vertex

(1, j)

and every vertex

(2, j + 2^{k} - 1 e x t (m o d (n / 2))

, for

k = 0, 1, c d o t s, D e l t a - 1

. In this paper, we determine the total domination number in

3

-regular Kn"odel graphs

W_{3, n}

.

Recommendations

Cites work

Cited in

(10)

This page was built for publication: Total domination in cubic Knodel graphs