On the independent domination polynomial of a graph
From MaRDI portal
Publication:2217495
DOI10.1016/j.dam.2020.10.019zbMath1454.05054arXiv1808.07369OpenAlexW3100737702MaRDI QIDQ2217495
Somayeh Jahari, Saeid Alikhani
Publication date: 29 December 2020
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1808.07369
Graph polynomials (05C31) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the roots of domination polynomial of graphs
- Clique cover products and unimodality of independence polynomials
- Independence polynomials of some compound graphs
- On the location of roots of independence polynomials
- On the unimodality of independence polynomials of some graphs
- Characterization of graphs using domination polynomials
- The roots of the independence polynomial of a clawfree graph
- Claw-free graphs. III: Circular interval graphs
- On the Eneström-Kakeya theorem and its sharpness
- Independent domination in graphs: A survey and recent results
- On the roots of domination polynomials
- Claw-free graphs. I: Orientable prismatic graphs
- Claw-free graphs. II: Non-orientable prismatic graphs
- On the corona of two graphs
- ON THE ROOTS OF TOTAL DOMINATION POLYNOMIAL OF GRAPHS, II
- Unimodal, log-concave and Pólya frequency sequences in combinatorics
- Location of Zeros of Chromatic and Related Polynomials of Graphs
- SOME FAMILIES OF GRAPHS WHOSE DOMINATION POLYNOMIALS ARE UNIMODAL
- The flower conjecture in special classes of graphs
- Introduction to Domination Polynomial of a Graph
- An introduction to chromatic polynomials
- The golden root of a chromatic polynomial
This page was built for publication: On the independent domination polynomial of a graph
