Dominating sets and domination polynomials of paths
From MaRDI portal
Abstract: Let G=(V,E) be a simple graph. A set Ssubset V is a dominating set of G, if every vertex in VS is adjacent to at least one vertex in S. Let {mathcal C}_n^i be the family of dominating sets of a cycle C_n with cardinality i, and let d(C_n,i) = |{mathcal C}_n^i. In this paper, we construct {mathcal C}_n^i, and obtain a recursive formula for d(C_n, i). Using this recursive formula, we consider the polynomial D(C_n, x) = sum_{i=1}^n d(C_n, i)x^i, which we call domination polynomial of cycles and obtain some properties of this polynomial.
Recommendations
Cites work
Cited in
(36)- Paths on polymatroids
- Connected domination polynomial of graphs
- Subset-sum representations of domination polynomials
- New network entropy : The domination entropy of graphs
- Perfect domination polynomial of homogeneous caterpillar graphs and of full binary trees
- Optimal domination polynomials
- Construction of dominating sets of certain graphs
- On the dominating set polytope
- On total edge fixed geodomination sets and polynomials of paths
- On the graphs with four distinct domination roots
- Dominating sets of centipedes
- Cycles are determined by their domination polynomials.
- Dominating sets and domination polynomials of certain graphs. II
- On the domination polynomial of some graph operations
- The domination polynomial of a graph at -1
- scientific article; zbMATH DE number 1933232 (Why is no real title available?)
- Algebraic integers as chromatic and domination roots
- Recurrence relations and splitting formulas for the domination polynomial
- scientific article; zbMATH DE number 6921365 (Why is no real title available?)
- Graphs whose certain polynomials have few distinct roots
- On coefficients of edge domination polynomial of a graph
- scientific article; zbMATH DE number 7587190 (Why is no real title available?)
- A study of mixed tree domination polynomials in some class of graphs
- The Domination Equivalence Classes of Paths
- Domination Polynomials of certain hexagon lattice graphs
- scientific article; zbMATH DE number 7671000 (Why is no real title available?)
- THE NUMBER OF CC-DOMINATING SETS OF SOME GRAPHS
- Domination polynomials of the grid, the cylinder, the torus, and the king graph
- On the number of isolate dominating sets of certain graphs
- On the Roman domination polynomials
- Characterization of graphs using domination polynomials
- Domination polynomials of some notable graph families
- Total outer-connected dominating sets and total outer-connected domination polynomial of complete bipartite graph \(K_{2,n}\)
- Twain secure perfect dominating sets and twain secure perfect domination polynomials of cycles
- On the location of roots of graph polynomials
- Complete r-partite graphs determined by their domination polynomial
This page was built for publication: Dominating sets and domination polynomials of paths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1028883)
