具有最大度距离的单圈图

摘要

Let U(n) be the set of all unicyclic graphs on n(n≥3) vertices. Let G(3; n-3) be the graph obtained from a triangle C3 by attaching a pendent path Pn-3. In this paper we prove that the extremal graph with maximum degree distance of unicyclic graphs is G(3; n-3) when n≥5.%设U(n)是具有n个顶点的所有单圈图的集合,G(3; n-3)是由一个三角形C3粘上一条悬挂路Pn-3得到的单圈图. 本文将证明当n≥5时具有最大度距离的单圈图是G(3; n-3).