TOTAL DOMINATION POLYNOMIAL OF GRAPHS FROM PRIMARY SUBGRAPHS

DOI10.22044/JAS.2018.1096MaRDI QIDQ4956403zbMATH OpenOpenAlexFDO

Publication date 1 September 2021

Full work available at URL https://arxiv.org/abs/1609.07789

total dominating set total domination number total domination polynomial

Graph polynomials (05C31) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Abstract: Let

G = (V, E)

be a simple graph of order

n

. The total dominating set is a subset

D

of

V

that every vertex of

V

is adjacent to some vertices of

D

. The total domination number of

G

is equal to minimum cardinality of total dominating set in

G

and denoted by

g a m m a_{t} (G)

. The total domination polynomial of

G

is the polynomial

D_{t} (G, x) = s u m d_{t} (G, i)

, where

d_{t} (G, i)

is the number of total dominating sets of

G

of size

i

. Let

G

be a connected graph constructed from pairwise disjoint connected graphs

G_{1}, l d o t s, G_{k}

by selecting a vertex of

G_{1}

, a vertex of

G_{2}

, and identify these two vertices. Then continue in this manner inductively. We say that

G

is obtained by point-attaching from

G_{1}, l d o t s, G_{k}

and that

G_{i}

's are the primary subgraphs of

G

. In this paper, we consider some particular cases of these graphs that most of them are of importance in chemistry and study their total domination polynomials.

Recommendations

Cites work

Cited in

(3)

This page was built for publication: TOTAL DOMINATION POLYNOMIAL OF GRAPHS FROM PRIMARY SUBGRAPHS

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4956403)