The average order of dominating sets of a graph

DOI10.1016/j.disc.2021.112595OpenAlexW3198254914MaRDI QIDQ2231709

Jason I. Brown, Iain Beaton

Publication date: 30 September 2021

Published in: Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

dominating setdomination polynomialaverage order of dominating sets

Mathematics Subject Classification ID

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

Related Items (2)

On the unimodality of domination polynomials ⋮ On the average order of a dominating set of a forest

Cites Work

• On the roots of domination polynomial of graphs
• Extremal results on average subtree density of series-reduced trees
• Recurrence relations and splitting formulas for the domination polynomial
• Characterization of graphs using domination polynomials
• Monotonicity of the mean order of subtrees
• The average order of a subtree of a tree
• Every poset has a central element
• Mean distance in a graph
• On the average number of nodes in a subtree of a tree
• The average size of matchings in graphs
• The average size of independent sets of graphs
• On the Local and Global Means of Subtree Orders
• The average size of a connected vertex set of a graph—Explicit formulas and open problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The average order of dominating sets of a graph