首页 | 本学科首页   官方微博 | 高级检索  
     检索      

一类几乎唯一泛圈图
引用本文:施永兵.一类几乎唯一泛圈图[J].系统科学与数学,2006,26(4):433-439.
作者姓名:施永兵
作者单位:上海师范大学数理信息学院,上海,200234
基金项目:上海市教委科技发展基金(04DB25)资助课题
摘    要:设G是阶为n的简单Hamilton图.若存在m(3(?)m
关 键 词:  几乎唯一泛圈图  简单MCD图
修稿时间:2003年12月8日

A Class of Almost Uniquely Pancyclic Graphs
Shi Yongbing.A Class of Almost Uniquely Pancyclic Graphs[J].Journal of Systems Science and Mathematical Sciences,2006,26(4):433-439.
Authors:Shi Yongbing
Institution:Mathematics and Sciences College, Shanghai Teachers University, Shanghai 200234
Abstract: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.
Keywords:Cycle  almost uniquely pancyclic graph  simple MCD graph    
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《系统科学与数学》浏览原始摘要信息
点击此处可从《系统科学与数学》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号