On the average order of a dominating set of a forest
From MaRDI portal
Publication:2092347
DOI10.1016/j.disc.2022.113127zbMath1502.05186arXiv2104.00600OpenAlexW3148685728MaRDI QIDQ2092347
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
Related Items (1)
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