Uniform length dominating sequence graphs

Abstract: A sequence of vertices

(v_{1},, d o t s,, v_{k})

of a graph

G

is called a {it dominating closed neighborhood sequence} if

v_{1},, d o t s,, v_{k}

is a dominating set of

G

and

N [v_{i}] s u b s e t e q c u p_{j = 1}^{i - 1} N [v_{j}]

for every

i

. A graph

G

is said to be {it

k -

uniform} if all dominating closed neighborhood sequences have equal length

k

. Bre{v s}ar et al. (2014) characterized

k

-uniform graphs with

k l e q 3

. In this article we extend their work by giving a complete characterization of all

k

-uniform graphs with

k g e q 4

.

Recommendations

Cites work

Cited in

(4)

This page was built for publication: Uniform length dominating sequence graphs