Domination polynomials of cubic graphs of order 10

MaRDI QIDQ3098552zbMATH OpenFDO

Authors Saeid Alikhani, Y. H. Peng

Publication date 17 November 2011

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

zbMATH Keywords

equivalence classcubic graphsdomination polynomialpetersen graph

Mathematics Subject Classification ID

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

Abstract: The domination polynomial of a graph $G$ of order $n$ is the polynomial $D(G,x)=su{m}_{i=gamma(G)}^{n}d(G,i)x^i$, where $d(G,i)$ is the number of dominating sets of $G$ of size $i$, and $gamma(G)$ is the domination number of $G$. The roots of domination polynomial is called domination roots. In this article, we compute the domination polynomial and domination roots of all graphs of order less than or equal to 6, and show them in the tables.

Recommendations

• Introduction to domination polynomial of a graph.
• Cycles are determined by their domination polynomials.
• Connected domination polynomial of graphs
• On the edge cover polynomial of certain graphs
• Dominating sets and domination polynomials of certain graphs. II

Cited in

(14)

• On the edge cover polynomial of certain graphs
• Coalition of cubic graphs of order at most 10
• Domination polynomial of clique cover product of graphs
• Algebraic integers as chromatic and domination roots
• Construction of dominating sets of certain graphs
• Cycles are determined by their domination polynomials.
• Complete r-partite graphs determined by their domination polynomial
• Strong domatic number of a graph
• Hop domination polynomial of graphs
• Connected domination polynomial of graphs
• The domination polynomial of a graph at -1
• The Domination Equivalence Classes of Paths
• Total coalitions of cubic graphs of order at most 10
• Alliance polynomial of regular graphs

This page was built for publication: Domination polynomials of cubic graphs of order 10

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