Subset-sum representations of domination polynomials

DOI10.1007/s00373-013-1286-zzbMath1291.05094arXiv1207.2430OpenAlexW1975155259MaRDI QIDQ2014717

James Preen, Tomer Kotek, Peter Tittmann

Publication date: 16 June 2014

Published in: Graphs and Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

dominating setdomination polynomialgraph polynomial

Mathematics Subject Classification ID

Graph polynomials (05C31) Enumeration in graph theory (05C30) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (5)

On the roots of domination polynomial of graphs ⋮ The average domination polynomial of graphs is unimodal ⋮ Graph operations and neighborhood polynomials ⋮ Neighborhood and domination polynomials of graphs ⋮ Bipartition polynomials, the Ising model, and domination in graphs

Cites Work

• Unnamed Item
• The domination polynomial of a graph at \(-1\)
• Domination reliability
• Characterization of graphs using domination polynomials
• Dominating sets and domination polynomials of paths
• Dominatind sets and domination polynomials of certain graphs. II
• Mean value for the matching and dominating polynomial

This page was built for publication: Subset-sum representations of domination polynomials