The number and average size of connected sets in graphs with degree constraints

DOI10.1002/jgt.22793zbMath1522.05227arXiv2105.13332OpenAlexW3164811824WikidataQ114236140 ScholiaQ114236140MaRDI QIDQ6081554

John Haslegrave

Publication date: 5 October 2023

Published in: Journal of Graph Theory (Search for Journal in Brave)

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

zbMATH Keywords

connected graphextremal graph theoryaverage graph parameterconnected induced subgraph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Connectivity (05C40)

Related Items (3)

A lower bound on the average size of a connected vertex set of a graph ⋮ Extremal problems for connected set enumeration ⋮ On the local and global mean orders of sub-\(k\)-trees of \(k\)-trees

Cites Work

• Extremal results on average subtree density of series-reduced trees
• Spanning trees with many leaves: new lower bounds in terms of the number of vertices of degree 3 and at least 4
• Monotonicity of the mean order of subtrees
• The average order of a subtree of a tree
• On the average number of nodes in a subtree of a tree
• The average size of a connected vertex set of a \(k\)-connected graph
• On the maximum mean subtree order of trees
• A lower bound on the average size of a connected vertex set of a graph
• Spanning Trees with Many Leaves
• On the Local and Global Means of Subtree Orders
• On the Mean Connected Induced Subgraph Order of Cographs
• Subtrees of graphs
• Maximizing the mean subtree order
• On the mean subtree order of graphs under edge addition
• The average size of a connected vertex set of a graph—Explicit formulas and open problems
• Unnamed Item
• Unnamed Item

This page was built for publication: The number and average size of connected sets in graphs with degree constraints