On domination polynomials of some graphs
Let \(G=G(V,E)\) be a finite, simple, and undirected graph. A nonempty set \(S\subseteq V(G)\) is a dominating set of \(G\) if every vertex of \(V\setminus S\) is adjacent to some vertex of \(S\). Let \(\gamma(G)\) denote the minimum cardinality of a dominating set in \(G\) and \(D(G,k)\) the number of dominating sets of size \(k\) in \(G\). Then the domination polynomial of \(G\) is defined as \(D(G,x)=\sum_{k=\gamma(G)}^{|V|}D(G,k)x^k\).\N\NIn the paper under review, the author studies the domination polynomial of graphs \(G(n_1,n_2,\ldots,n_t)\), which are constructed as follows. Take the disjoint union of cliques \(K_{n_i}\) for \(2\leq i\leq t\), and an additional clique \(K_{n_1}\) such that each vertex of \(K_{n_1}\) is adjacent to each vertex of \(\bigcup_{i=2}^t K_{n_i}\). The author obtains \(D(G(n_1,n_2,\ldots,n_t),x)\), proves that the sequences of coefficients of the polynomials \(D(G(1,\underbrace{2,\ldots,2}_n),x)\), \(D(G(1,\underbrace{n,\ldots,n}_n),x)\) and \(D(G(\underbrace{n,\ldots,n}_{n+1}),x)\) are unimodal and log-concave, and finds bounds on the modulus of the roots of these polynomials (in terms of \(n\)).
- Characterization of graphs using domination polynomials
- Complete r-partite graphs determined by their domination polynomial
- Graphs whose certain polynomials have few distinct roots
- scientific article; zbMATH DE number 3836093 (Why is no real title available?)
- scientific article; zbMATH DE number 4112649 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3232670 (Why is no real title available?)
- Independent domination polynomial for the cozero divisor graph of the ring of integers modulo \(n\)
- On the domination polynomials of friendship graphs
- On the independence polynomial of the corona of graphs
- On the roots of domination polynomials
- On the unimodality of independence polynomials of some graphs
- Polynomials
- Roots of independence polynomials of well covered graphs
- The domination polynomial of a graph at -1
- Unimodality of some independence polynomials via their palindromicity
This page was built for publication: On domination polynomials of some graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6921018)
