Domination polynomials of \(k\)-tree related graphs

DOI10.1155/2014/390170zbMath1303.05139arXiv1511.00159OpenAlexW2108776333WikidataQ59043548 ScholiaQ59043548MaRDI QIDQ471790

Saeid Alikhani, Somayeh Jahari

Publication date: 17 November 2014

Published in: International Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1511.00159

zbMATH Keywords

dominating sets

Mathematics Subject Classification ID

Trees (05C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (3)

The zero forcing polynomial of a graph ⋮ Domination polynomial of clique cover product of graphs ⋮ Some families of graphs with no nonzero real domination roots

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the domination polynomial of some graph operations
• The domination polynomial of a graph at \(-1\)
• Recurrence relations and splitting formulas for the domination polynomial
• Characterization of graphs using domination polynomials
• Independence polynomials of \(k\)-tree related graphs
• The cyclomatic number of a graph and its independence polynomial at \(- 1\)
• On the roots of domination polynomials
• On the corona of two graphs
• Dominatind sets and domination polynomials of certain graphs. II
• On acyclic simplicial complexes
• The number of labeled k-dimensional trees

This page was built for publication: Domination polynomials of \(k\)-tree related graphs