On the graphs with four distinct domination roots

The domination polynomial of a graph G of order n is the polynomial , where d(G, i) is the number of dominating vertex sets of G with cardinality i. A root of D(G, x) is called a domination root of G. In this paper, we characterize graphs with exactly four distinct domination roots .

Saved in:
Bibliographic Details
Published inInternational journal of computer mathematics Vol. 88; no. 13; pp. 2717 - 2720
Main Author Alikhani, Saeid
Format Journal Article
LanguageEnglish
Published Abingdon Taylor & Francis 01.09.2011
Taylor & Francis Ltd
Subjects
dominating set
domination polynomial
domination root
G.2.2
Graphs
Mathematical models
Mathematics
Polynomials
Roots
Vertex sets
Online AccessGet full text

Cover

More Information
Summary:The domination polynomial of a graph G of order n is the polynomial , where d(G, i) is the number of dominating vertex sets of G with cardinality i. A root of D(G, x) is called a domination root of G. In this paper, we characterize graphs with exactly four distinct domination roots .
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0020-7160
1029-0265
DOI:10.1080/00207160.2011.571771