Loading...

Cycles are determined by their domination polynomials

Akbari, S ; Sharif University of Technology

282 Viewed
  1. Type of Document: Article
  2. Abstract:
  3. Let G be a simple graph of order n. A dominating set of G is a set S of vertices of G so that every vertex of G is either in S or adjacent to a vertex in 5. The domination polynomial of G is the polynomial D(G, x) = Σn i=1 d(G, i) xi, where d(G, i) is the number of dominating sets of G of size i. In this paper we show that cycles are determined by their domination polynomials
  4. Keywords:
  5. Cycle ; Dominating set ; Domination polynomial ; Equivalence class
  6. Source: Ars Combinatoria ; Vol. 116, issue , 2014 , p. 353-358
  7. URL: http://cs.aminer.org/publication/cycles-are-determined-by-their-domination-polynomials-4169575.html