Complete \(r\)-partite graphs determined by their domination polynomial

DOI10.1007/s00373-014-1521-2zbMath1328.05137arXiv1303.5999OpenAlexW2116691864MaRDI QIDQ897257

Barbara M. Anthony, Michael E. Picollelli

Publication date: 17 December 2015

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

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

zbMATH Keywords

dominating setdomination polynomial\(\mathcal D\)-unique graphs

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (3)

On the structure of dominating graphs ⋮ The Domination Equivalence Classes of Paths ⋮ Domination polynomial of clique cover product of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Characterization of graphs using domination polynomials
• Research problems from the BCC22
• Shadows and intersections: Stability and new proofs
• Dominating sets and domination polynomials of paths
• An atlas of domination polynomials of graphs of order at most six
• Dominatind sets and domination polynomials of certain graphs. II
• Mean value for the matching and dominating polynomial
• Introduction to Domination Polynomial of a Graph

This page was built for publication: Complete \(r\)-partite graphs determined by their domination polynomial