(4)-泛圈图的一个必要条件  

One Necessary Conditions for(4)-pancyclic Graphs

作　　者：张耀静 ZHANG Yaojing(School of Mathematics and Statistics, Minnan Normal University, Zhangzhou, Fujian 363000, China;Institute of Meteorological Big Data-Digital Fujian, Zhangzhou, Fujian 363000, China)

机构地区：[1]闽南师范大学数学与统计学院,福建漳州363000 [2]数字福建气象大数据研究所,福建漳州363000

出　　处：《闽南师范大学学报（自然科学版）》2019年第1期10-20,共11页Journal of Minnan Normal University：Natural Science

基　　金：福建省自然科学基金(2015J01018)

摘　　要：(k)-泛圈图是指对每一个r(3≤r≤n),阶为n的图G恰好有k个长为r的圈.本文主要探讨只含有2对缠绕弦的(4)-泛圈图中包含2对缠绕弦的生成子图结构以及其阶.A graph G which are simple undirected finite connected graphs of order n is said to be(k)-pancyclic if G contains exactly k cycles of length r for all r satisfying 3≤r≤n. In this paper, we mainly discusses the structure and order of generating subgraphs with 2 pairs of interwined chords in(4)-pancyclic graphs containing only 2 pairs of interwined chords.

关 键 词：(4)-泛圈图 缠绕弦 圈 

分 类 号：G255.1[文化科学—图书馆学]