【摘要】 证明了k≥11时,2k(k∈N)阶具完美匹配的单圈图的最小度距离图是由一个三角形并在三角形一个顶点粘上k-2条长度为2的路和一条悬挂边构成的.更多还原

【Abstract】 In this paper,we proved that,when k ≥ 11,the extremal graph with minimum degree distance of unicyclic graphs with perfect matching of order 2k(k ∈ N)is a graph of a triangle by attaching k-2 paths with length 2 and one pendent edge to one of its vertices.更多还原