The average size of a connected vertex set of a graph—Explicit formulas and open problems
From MaRDI portal
Publication:6055930
DOI10.1002/jgt.22643zbMath1521.05074OpenAlexW3096856257MaRDI QIDQ6055930
Publication date: 29 September 2023
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.22643
Related Items (7)
A lower bound on the average size of a connected vertex set of a graph ⋮ The number and average size of connected sets in graphs with degree constraints ⋮ Extremal problems for connected set enumeration ⋮ On the local and global mean orders of sub-\(k\)-trees of \(k\)-trees ⋮ The average order of dominating sets of a graph ⋮ The average size of a connected vertex set of a \(k\)-connected graph ⋮ The path minimises the average size of a connected induced subgraph
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Extremal results on average subtree density of series-reduced trees
- Monotonicity of the mean order of subtrees
- Enumeration of subtrees of trees
- The average order of a subtree of a tree
- On the average number of nodes in a subtree of a tree
- On the Local and Global Means of Subtree Orders
- The mean order of sub‐k‐trees of k‐trees
- On the Mean Connected Induced Subgraph Order of Cographs
- Maximizing the mean subtree order
This page was built for publication: The average size of a connected vertex set of a graph—Explicit formulas and open problems