Work

Decreasing the mean subtree order by adding k edges

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.
Language: English
Open Access status: green
OpenAlex ID: W4387450652
FWCI: 1.181
Cites: 11
Cited by: 6
Related to: 10