Neighborhood and domination polynomials of graphs

DOI10.1007/s00373-018-1968-7zbMath1402.05108OpenAlexW2898017675MaRDI QIDQ1756089

Peter Tittmann, Irene Heinrich

Publication date: 11 January 2019

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

Full work available at URL: https://doi.org/10.1007/s00373-018-1968-7

zbMATH Keywords

dominating setgraph polynomialgraphical enumerationneighborhood complex

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

The neighborhood polynomial of chordal graphs, Graph operations and neighborhood polynomials, Asymptotic growth rate of square grids dominating sets: a symbolic dynamics approach, The Neighborhood Polynomial of Chordal Graphs

Cites Work

• Unnamed Item
• Domination reliability
• Recurrence relations and splitting formulas for the domination polynomial
• Characterization of graphs using domination polynomials
• Kneser's conjecture, chromatic number, and homotopy
• Subset-sum representations of domination polynomials
• Bipartition polynomials, the Ising model, and domination in graphs
• Threshold graphs, shifted complexes, and graphical complexes
• The topology of the independence complex
• Mean value for the matching and dominating polynomial