Corpus ID: 235422021

More on total domination polynomial and $\mathcal{D}_t$-equivalence classes of some graphs

@inproceedings{Alikhani2021MoreOT,
  title={More on total domination polynomial and \$\mathcal\{D\}\_t\$-equivalence classes of some graphs},
  author={S. Alikhani and N. Jafari},
  year={2021}
}
Let G = (V,E) be a simple graph of order n. The total dominating set of G 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 is denoted by γt(G). The total domination polynomial of G is the polynomial Dt(G, x) = ∑n i=γt(G) dt(G, i)x , where dt(G, i) is the number of total dominating sets of G of size i. Two graphs G and H are said to be total dominating equivalent or… Expand

References

SHOWING 1-10 OF 28 REFERENCES
On the roots of total domination polynomial of graphs
Abstract Let G = (V, E) be a simple graph of order n. A total dominating set of G is a subset D of V, such that every vertex of V is adjacent to at least one vertex in D. The total domination numberExpand
Characterization of graphs using domination polynomials
TLDR
This paper shows that if a graph G has two distinct domination roots, then Z(D(G,x))={-2,0}, and it is shown that if n=0,2(mod3), then C"n is D-unique, and if n =0(mod 3), then [P"n] consists of exactly two graphs. Expand
ON THE ROOTS OF TOTAL DOMINATION POLYNOMIAL OF GRAPHS, II
Let $G = (V, E)$ be a simple graph of order $n$. A  total dominating set of $G$ is a subset $D$ of $V$, such that every vertex of $V$ is adjacent to at least one vertex in  $D$. The total dominationExpand
Some new results on the total domination polynomial of a graph
Let $G = (V, E)$ be a simple graph of order $n$. The total dominating set of $G$ is a subset $D$ of $V$ that every vertex of $V$ is adjacent to some vertices of $D$. The total domination number ofExpand
Total domination polynomial of graphs from primary subgraphs
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$ isExpand
An atlas of domination polynomials of graphs of order at most six
The domination polynomial of a graph $G$ of order $n$ is the polynomial $D(G,x)=\sum_{i=\gamma(G)}^{n} d(G,i) x^{i}$, where $d(G,i)$ is the number of dominating sets of $G$ of size $i$, andExpand
On the independence polynomial of the corona of graphs
TLDR
This paper shows that I ( G ? H ; x ) is palindromic for every graph G if and only if H = K r - e , r ? 2 . Expand
ON A PROBLEM OF GRAPH THEORY
TLDR
A long-standing problem about the maximal number of edges of a graph not containing a cycle of length 4 is solved and some unsolved problems are mentioned. Expand
Cycles are determined by their domination polynomials
TLDR
It is shown that cycles are determined by their domination polynomials. Expand
Domination polynomial of clique cover product of graphs
Let $G$ be a simple graph of order $n$. The domination polynomial of $G$ is the polynomial $D(G, x)=\sum_{i=1}^n d(G,i) x^i$, where $d(G,i)$ is the number of dominating sets of $G$ of size $i$. ForExpand
...
1
2
3
...