Abstract
The domination polynomial of a graph of order is the polynomial , where is the number of dominating sets of of size , and is the domination number of . 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.
Connections
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 review
No reviews yet.
Discussion 0
Add a comment
No comments yet.