On the average order of a dominating set of a forest

@article{Erey2021OnTA,
  title={On the average order of a dominating set of a forest},
  author={Aysel Erey},
  journal={Discrete Mathematics},
  year={2021}
}
  • A. Erey
  • Published 1 April 2021
  • Mathematics
  • Discrete Mathematics

The average order of dominating sets of a graph

References

SHOWING 1-10 OF 21 REFERENCES

The average order of dominating sets of a graph

The average order of a subtree of a tree

The average size of independent sets of graphs

We study the average size of independent (vertex) sets of a graph. This invariant can be regarded as the logarithmic derivative of the independence polynomial evaluated at 1. We are specifically

The average connectivity of a graph

On the mean subtree order of graphs under edge addition

TLDR
It is shown that the addition of a single edge between a pair of nonadjacent vertices in a graph of order $n$ can decrease the mean subtree order by as much as $n/3$ asymptotically.

The Average Size of Matchings in Graphs

TLDR
In this paper, the average size of independent edge sets, also called matchings, in a graph is considered and inequalities between the average sizes and the number of matchings as well as the matching energy are obtained.

Mean distance in a graph

On mean distance in certain classes of graphs

TLDR
It is shown that if t ≥ 2 is rational, then there exist graphs with arbitrarily low or high edge density, bipartite graphs and oriented graphs withmean distance equal to t, and also trees and tournaments with mean distance arbitrarily close to t.

On the roots of domination polynomial of graphs

Average distance and domination number revisited