The average domination polynomial of graphs is unimodal
From MaRDI portal
Publication:5051450
DOI10.47443/dml.2021.0075OpenAlexW4210291434MaRDI QIDQ5051450
Publication date: 23 November 2022
Published in: Discrete Mathematics Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.47443/dml.2021.0075
Graph polynomials (05C31) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the roots of domination polynomial of graphs
- Domination reliability
- On the unimodality of independence polynomials of some graphs
- On the roots of edge cover polynomials of graphs
- On the edge cover polynomial of a graph
- Characterization of graphs using domination polynomials
- An extension of the bivariate chromatic polynomial
- Some results on the independence polynomial of unicyclic graphs
- Average independence polynomials
- Subset-sum representations of domination polynomials
- Milnor numbers of projective hypersurfaces and the chromatic polynomial of graphs
- Cycles are determined by their domination polynomials
- Introduction to Domination Polynomial of a Graph
- On the number of perfect matchings of generalized theta graphs and the edge cover polynomials of friendship graphs
- On the domination polynomials of friendship graphs
- An introduction to chromatic polynomials
This page was built for publication: The average domination polynomial of graphs is unimodal
