On the average order of a dominating set of a forest

DOI10.1016/j.disc.2022.113127zbMath1502.05186arXiv2104.00600OpenAlexW3148685728MaRDI QIDQ2092347

Aysel Erey

Publication date: 2 November 2022

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

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

zbMATH Keywords

average orderdominating setforest

Mathematics Subject Classification ID

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

Related Items (1)

Extremal graphs for average sizes of maximal matchings

Cites Work

• On the roots of domination polynomial of graphs
• Recurrence relations and splitting formulas for the domination polynomial
• Average distance and generalised packing in graphs
• Characterization of graphs using domination polynomials
• The average order of a subtree of a tree
• Mean distance in a graph
• The average connectivity of a graph
• Average eccentricity, \(k\)-packing and \(k\)-domination in graphs
• 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
• The average order of dominating sets of a graph
• Average distance and domination number revisited
• On the Local and Global Means of Subtree Orders
• The average distance and the independence number
• On mean distance in certain classes of graphs
• On the average size of independent sets in triangle-free graphs
• The Average Distance in a Random Graph with Given Expected Degrees
• Maximizing the mean subtree order
• On the mean subtree order of graphs under edge addition

This page was built for publication: On the average order of a dominating set of a forest