The Domination Equivalence Classes of Paths

zbMath1411.05198arXiv1710.03871MaRDI QIDQ5377030

Ian Beaton, Jason I. Brown

Publication date: 23 May 2019

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

zbMATH Keywords

domination polynomial

Mathematics Subject Classification ID

Graph polynomials (05C31) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (2)

Independence equivalence classes of cycles ⋮ The Domination Equivalence Classes of Paths

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The domination polynomial of a graph at \(-1\)
• Recurrence relations and splitting formulas for the domination polynomial
• Characterization of graphs using domination polynomials
• Complete \(r\)-partite graphs determined by their domination polynomial
• Dominating sets and domination polynomials of paths
• An atlas of domination polynomials of graphs of order at most six
• Cycles are determined by their domination polynomials
• Finite Dominating Sets for Network Location Problems
• Introduction to Domination Polynomial of a Graph
• The Domination Equivalence Classes of Paths

This page was built for publication: The Domination Equivalence Classes of Paths