The Domination Equivalence Classes of Paths

Abstract: A dominating set

S

of a graph

G

of order

n

is a subset of the vertices of

G

such that every vertex is either in

S

or adjacent to a vertex of

S

. %The domination number

G

, denoted

g a m m a (G)

, is the cardinality of the smallest dominating set of

G

. The domination polynomial is defined by

D (G, x) = s u m d (G, i) x^{i}

where

d (G, i)

is the number of dominating sets in

G

with cardinality

i

. Two graphs

G

and

H

are considered

m a t h c a l D

-equivalent if

D (G, x) = D (H, x)

. The equivalence class of

G

, denoted

[G]

, is the set of all graphs

m a t h c a l D

-equivalent to

G

. Extending previous results, we determine the equivalence classes of all paths.

Recommendations

Cites work

Cited in

(9)

This page was built for publication: The Domination Equivalence Classes of Paths