Optimal domination polynomials

DOI10.1007/s00373-020-02202-8zbMath1458.05116arXiv1904.06267OpenAlexW3035467309MaRDI QIDQ2227988

Danielle Cox, Iain Beaton, Jason I. Brown

Publication date: 16 February 2021

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

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

zbMATH Keywords

reliabilityoptimalitydomination polynomial

Mathematics Subject Classification ID

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

Related Items (1)

The node cop‐win reliability of unicyclic and bicyclic graphs

Cites Work

• Domination reliability
• Characterization of graphs using domination polynomials
• Optimal graphs for independence and \(k\)-independence polynomials
• Optimal graphs for chromatic polynomials
• SOME CONJECTURED UNIFORMLY OPTIMAL RELIABLE NETWORKS
• Uniformly-most reliable networks do not always exist
• Least reliable networks and the reliability domination
• Uniformly optimally reliable graphs
• Nonexistence of optimal graphs for all terminal reliability
• Graphs with least number of colorings
• Introduction to Domination Polynomial of a Graph
• On the existence of uniformly optimally reliable networks

This page was built for publication: Optimal domination polynomials