An atlas of domination polynomials of graphs of order at most six

preprint2014arXivOpen access

Abstract

The domination polynomial of a graph GG of order nn is the polynomial D(G,x)=∑i=γ(G)nd(G,i)xiD(G,x)=\sum_{i=γ(G)}^{n} d(G,i) x^{i}, where d(G,i)d(G,i) is the number of dominating sets of GG of size ii, and γ(G)γ(G) is the domination number of GG. 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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.