Year: 2023
Type: article
Abstract: The mean subtree order of a given graph , denoted , is the average number of vertices in a subtree of . Let be a connected graph. Chin et al. conjectured that if is a proper spanning supergraph of , then . Cameron and Mol disproved this conjecture by showing that there are infinitely many pairs of graphs and with , and such that . They also conjectured that for every positive integer , there exists a pair of graphs and with , , and such that . Furthermore, they proposed that provided . In this note, we confirm these two conjectures.
Source: Journal of Graph Theory
DOI: 10.1002/jgt.23043
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Keywords: edge addition, graph enumeration, subtrees
Open Access status: green
OpenAlex ID: W4387450652
