Complete r-partite graphs determined by their domination polynomial

Autor:	Anthony, Barbara M., Picollelli, Michael E.
Rok vydání:	2013
Předmět:	Mathematics - Combinatorics
Druh dokumentu:	Working Paper
Popis:	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-partite graphs which are; in the bipartite case, this settles in the affirmative a conjecture of Aalipour, Akbari and Ebrahimi. Comment: 13 pages, 3 figures - corrected references, adjusted start of Section 2
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/1303.5999 Zobrazit plný text záznamu View this record from Arxiv