Cycles are determined by their domination polynomials

zbMath1340.05136arXiv0908.3305MaRDI QIDQ3447613

Saieed Akbari, Mohammad Reza Oboudi

Publication date: 27 October 2015

Full work available at URL: https://arxiv.org/abs/0908.3305

zbMATH Keywords

cycledominating setequivalence classdomination polynomial

Mathematics Subject Classification ID

Graph polynomials (05C31) Paths and cycles (05C38) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (7)

On the roots of domination polynomial of graphs ⋮ The average domination polynomial of graphs is unimodal ⋮ On the number of perfect matchings of generalized theta graphs and the edge cover polynomials of friendship graphs ⋮ The domination polynomial of a graph at \(-1\) ⋮ Some results on the independence polynomial of unicyclic graphs ⋮ Graphs whose certain polynomials have few distinct roots ⋮ The Domination Equivalence Classes of Paths

This page was built for publication: Cycles are determined by their domination polynomials