| A NEIGHBORHOOD UNION CONDITION FOR PANCYCLIC GRAPHS |
| |
| 作者姓名： | LI Xiangwen |
| |
| 作者单位： | LI Xiangwen(Department of Mathematics，Huazhong Normal University，Wuhan 430070，China)WEI Bing(Institute of Systems Science，Academia Sinica，Beijing 100080，China) |
| |
| 摘 要： | 1.IntroductionWeconsideronlysimplefinitegraphs.OurbasicnotationandterminologynotdefinedherefollowthOSeofBondyandMurtyll].ForagraphG,letV(G)andE(G)(orjustVandE)deDOtelievertexsetandedgeset,respectively.Wedenoteapathandacyclecontaining8veniCesbyPaandCarespectively.ThecycleCaiscalledans-cycle.Denotebyg(G)(orbrieflybyg)thegirthofG1.SetNC=min{IN(u)UN(v)l:tv
|
A NEIGHBORHOOD UNION CONDITION FOR PANCYCLIC GRAPHS |
| |
| LI Xiangwen.A NEIGHBORHOOD UNION CONDITION FOR PANCYCLIC GRAPHS[J].Journal of Systems Science and Complexity,1998(4). |
| |
| Authors: | LI Xiangwen |
| |
| Abstract: | Let C be a 2-connected graph on > 2 31 venices. G is called pancyclic if itcontains a cycle of length I for every I such that 3 l n. In this paper we shall prove thatif IN(u) U N(v) Z (2n - 3)/3 for any nonadjacent pair uv E V(G), then G is pancyclic. |
| |
| Keywords: | Neighborhood union cycle pancyclic graph |
| 本文献已被 CNKI 等数据库收录！ |
