Abstract:The mean subtree order of a graph is the number of vertices of all subtrees of this graph divided by the number of all subtrees of this graph. In 2021, Cameron and Mol constructed a special graph of order and proved that the addition of a single edge between a pair of nonadjacent vertices in the graph can decrease the mean subtree order by as much as when is large enough. Moreover, they left a conjecture that for every positive integer , there exists a graph obtained by adding edges to another graph , the… Show more
Set email alert for when this publication receives citations?
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.