More on the unimodality of domination polynomial of a graph
From MaRDI portal
Publication:5083860
DOI10.1142/S179383092150138XzbMath1489.05110OpenAlexW3168780631MaRDI QIDQ5083860
Publication date: 21 June 2022
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s179383092150138x
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Clique cover products and unimodality of independence polynomials
- Domination reliability
- Recurrence relations and splitting formulas for the domination polynomial
- Characterization of graphs using domination polynomials
- On unique minimum dominating sets in some Cartesian product graphs
- A generalization of Vizing's theorem on domination
- On the Real Roots of Domination Polynomials
- Finite Dominating Sets for Network Location Problems
- SOME FAMILIES OF GRAPHS WHOSE DOMINATION POLYNOMIALS ARE UNIMODAL
- Introduction to Domination Polynomial of a Graph
- On the roots of total domination polynomial of graphs
- Some Results for Discrete Unimodality
- Block graphs with unique minimum dominating sets
This page was built for publication: More on the unimodality of domination polynomial of a graph