On the roots of domination polynomial of graphs
From MaRDI portal
Publication:266947
DOI10.1016/j.dam.2015.12.010zbMath1333.05229OpenAlexW2236877021MaRDI QIDQ266947
Publication date: 7 April 2016
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2015.12.010
Graph polynomials (05C31) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items
On the roots of total domination polynomial of graphs ⋮ On the Tutte and Matching Polynomials for Complete 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 ⋮ On the Real Roots of Domination Polynomials ⋮ Some results on the independence polynomial of unicyclic graphs ⋮ On the independent domination polynomial of a graph ⋮ The average order of dominating sets of a graph ⋮ Some applications of Wagner's weighted subgraph counting polynomial ⋮ Graph polynomials for a class of DI-pathological graphs ⋮ On the doubly connected domination polynomial of a graph ⋮ On the average order of a dominating set of a forest ⋮ Some families of graphs with no nonzero real domination roots
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Domination reliability
- Recurrence relations and splitting formulas for the domination polynomial
- On the location of roots of independence polynomials
- On the roots of edge cover polynomials of graphs
- Characterization of graphs using domination polynomials
- An extension of the bivariate chromatic polynomial
- Problems in algebraic combinatorics
- Chromatic roots and Hamiltonian paths
- On the roots of domination polynomials
- Subset-sum representations of domination polynomials
- On the corona of two graphs
- Theory of monomer-dimer systems
- Bounds on the Complex Zeros of (Di)Chromatic Polynomials and Potts-Model Partition Functions
- Cycles are determined by their domination polynomials
- Domination-balanced graphs
- The Zero-Free Intervals for Chromatic Polynomials of Graphs
- Mean value for the matching and dominating polynomial
- Domination Polynomials of Graph Products
- Introduction to Domination Polynomial of a Graph