AI 中文总结
解决Boots-Royle/Cao-Vince猜想，即对于n≥9，确定具有最大邻接谱半径的唯一平面图，前人已证足够大阶数情况，本文给出完整解决方案。
AI 中文摘要
Boots和Royle以及独立的Cao和Vince猜想，对于n≥9，一条边与n - 2个顶点的路径的联图是具有最大邻接谱半径的唯一平面图。Tait和Tobin证明了该猜想对于足够大的阶数成立。本文完全解决了Boots-Royle/Cao-Vince猜想。
英文摘要
Boots and Royle, and independently Cao and Vince, conjectured that the join of an edge and a path on $n-2$ vertices is the unique planar graph of maximum adjacency spectral radius for $n\geq 9$. Tait and Tobin (JCTB, 2017) proved the conjecture for sufficiently large order. In this paper, we completely resolved the Boots-Royle/Cao-Vince conjecture.
Comments19 pages, 2 figures
