摘要
证明了如果Ｇ是２连通无爪图，Ｇ不是圈，ｎ＝｜Ｖ（Ｇ）｜≥９，Ｇ的每个同构于Ａ的导出子图都满足Φ（ａ１，ａ２）且Ｇ中不含同构于Ｄ的导出子图。
Abstract This paper proves that if “G” is a biconnected {K 1.3 , D} free graph, “G” is not a cycle. n=|V(G)|≥9 and each induced subgraph A of “G” satisfies Φ(a 1,a 2), then “G” is pancyclicity graph of GG 1.
出处
《工程数学学报》
CSCD
北大核心
1997年第1期109-112,共4页
Chinese Journal of Engineering Mathematics
