The domination polynomial of a graph at \(-1\)
From MaRDI portal
Publication:367055
DOI10.1007/s00373-012-1211-xzbMath1272.05144OpenAlexW2036539507MaRDI QIDQ367055
Publication date: 26 September 2013
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-012-1211-x
Graph polynomials (05C31) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (9)
On the structure of dominating graphs ⋮ Counting independent dominating sets in linear polymers ⋮ Algebraic integers as chromatic and domination roots ⋮ Graphs whose certain polynomials have few distinct roots ⋮ Domination polynomials of \(k\)-tree related graphs ⋮ Graph polynomials for a class of DI-pathological graphs ⋮ Subset-sum representations of domination polynomials ⋮ The Domination Equivalence Classes of Paths ⋮ Perfect domination polynomial of homogeneous caterpillar graphs and of full binary trees
Cites Work
- Independence roots and independence fractals of certain graphs
- Characterization of graphs using domination polynomials
- Dominating sets and domination polynomials of paths
- The interlace polynomial of graphs at \(-1\)
- The cyclomatic number of a graph and its independence polynomial at \(- 1\)
- On the corona of two graphs
- Acyclic orientations of graphs
- An atlas of domination polynomials of graphs of order at most six
- Cycles are determined by their domination polynomials
- Dominatind sets and domination polynomials of certain graphs. II
- Mean value for the matching and dominating polynomial
- Introduction to Domination Polynomial of a Graph
This page was built for publication: The domination polynomial of a graph at \(-1\)