【摘要】 设G是阶为n的简单Hamilton图．若存在m(3(?)m<n)使对每个l∈{3,4,…,n}-{m},G恰有一个长为l的圈且不含长为m的圈,则称G是几乎唯一泛圈图．用Г0k表示具有n+k条边和恰有(k2+5k-2)/2个圈的简单H图的集合．作者确定了Г0k中所有几乎唯一泛圈图,并证明这些图都是简单MCD图．更多还原

【Abstract】 Let G be a simple Hamilton graph with n vertices. If there exists m(3(?)m<n) such that G contains exactly one cycle of length l for every l∈{3,4,…n}-{m} and contains no cycle of length of m; then G is called almost uniquely pancyclic graph. LetГ0k denote the set of simple Hamilton graphs with n+k edges and (k2+5k-2/2) cycles. In this paper all almost uniquely pancyclic graphs inГ0k are determined and are proved to be simple MCD graphs.更多还原