%0 Journal Article
%T A Class of Almost Uniquely Pancyclic Graphs<br>一类几乎唯一泛圈图
%A Shi Yongbing
%A <br>施永兵
%J 系统科学与数学
%D 2006
%I 
%X Let $G$ be a simple Hamilton graph with $n$ vertices. If there exists $m(3\leq m<n)$ such that $G$ contains exactly one cycle of length $l$ for every $l\in \{3,4,\cdots,n\}-\{m\}$ and contains no cycle of length of $m$, then $G$ is called almost uniquely pancyclic graph. Let ${\it\Gamma}_k^0$ denote the set of simple Hamilton graphs with $n+k$ edges and $\frac{k^2+5k-2}{2}$ cycles. In this paper all almost uniquely pancyclic graphs in ${\it\Gamma}_k^0$ are determined and are proved to be simple MCD graphs.
%K Cycle
%K almost uniquely pancyclic graph
%K simple MCD graph<br>圈
%K 几乎唯一泛圈图
%K 简单MCD图
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=6E709DC38FA1D09A4B578DD0906875B5B44D4D294832BB8E&cid=37F46C35E03B4B86&jid=0CD45CC5E994895A7F41A783D4235EC2&aid=5950846612906417&yid=37904DC365DD7266&vid=96C778EE049EE47D&iid=E158A972A605785F&sid=DDEED1BDDBFAA8A7&eid=AC2617B68B137D9D&journal_id=1000-0577&journal_name=系统科学与数学&referenced_num=2&reference_num=10