Paper Info
Title
Complete $$r$$r-partite Graphs Determined by their Domination Polynomial
Abstract
The domination polynomial of a graph is the polynomial whose coefficients count the number of dominating sets of each cardinality. A recent question asks which graphs are uniquely determined (up to isomorphism) by their domination polynomial. In this paper, we completely describe the complete $$r$$r-partite graphs which are; in the bipartite case, this settles in the affirmative a conjecture of Aalipour et al. (Ars Comb, 2014).
Year
DOI
Venue
2015
10.1007/s00373-014-1521-2
Graphs and Combinatorics
Keywords
DocType
Volume
Domination polynomial,Dominating set,D-unique graphs
Journal
31
Issue
ISSN
Citations 
6
0911-0119
1
PageRank 
References 
Authors
0.37
5
2
Name
Order
Citations
PageRank
Barbara M. Anthony1225.41
Michael E. Picollelli2102.56