arXiv (All)
open access
On the extrema of the mean subtree order of graphs
It has been conjectured that the minimum and maximum of the mean subtree order among connected graphs of order $n$ are attained by the path $P_n$ and clique $K_n$, respectively. Extending ideas due to Haslegrave and Vince, we confirm that the minimum is indeed attained by $P_n$. We also show that th
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Order 14 is the largest order for which every 4-total coloring of every cubic graph is equitable#972196
- Majority C-coloring in Cartesian products#780968
- Majority C-coloring in Cartesian products#779593
- The diameter of recoloring graphs under a maximum average degree bound#1117019
- Crown graphs maximise the representation number of bipartite graphs#1130684
Record · ID 1013436
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive