An Implicit Degree Ore-condition for Pancyclicity of Graphs

被引：0

作者：

Hao LI ^{[1
,2
]}

Jun Qing CAI ^{[3
]}

机构：

[1] LRI, UMR , CNRS and Universit Paris-Sud , F- Orsay, France

[2] Institute for Interdisciplinary Research, Jianghan University

[3] School of Management, Qufu Normal

来源：

ActaMathematicaSinica | 2013年 / 29卷 / 09期

关键词：

D O I：

暂无

中图分类号：

O157.5 [图论];

学科分类号：

摘要：

In 1989, Zhu, Li and Deng introduced the definition of implicit degree of a vertex v in a graph G, denoted by id(v). In this paper, we prove that if G is a 2-connected graph of order n such that id(u) + id(v) ≥ n for each pair of nonadjacent vertices u and v in G, then G is pancyclic unless G is bipartite, or else n = 4r, r ≥ 2 and G is isomorphic to F4r .

引用

页码：1773 / 1780

页数：8

共 50 条

[1] An Implicit Degree Ore-condition for Pancyclicity of Graphs
Hao LI
Jun Qing CAI
Acta Mathematica Sinica,English Series, 2013, (09) : 1773 - 1780
[2] An implicit degree ore-condition for pancyclicity of graphs
Hao Li
Jun Qing Cai
Acta Mathematica Sinica, English Series, 2013, 29 : 1773 - 1780
[3] An implicit degree ore-condition for pancyclicity of graphs
Li, Hao
Cai, Jun Qing
ACTA MATHEMATICA SINICA-ENGLISH SERIES, 2013, 29 (09) : 1773 - 1780
[4] An Implicit Degree Condition for Pancyclicity of Graphs
Hao Li
Junqing Cai
Wantao Ning
Graphs and Combinatorics, 2013, 29 : 1459 - 1469
[5] An Implicit Degree Condition for Pancyclicity of Graphs
Li, Hao
Cai, Junqing
Ning, Wantao
GRAPHS AND COMBINATORICS, 2013, 29 (05) : 1459 - 1469
[6] A Generalization of Implicit Ore-condition for Hamiltonicity of k-connected Graphs
Jun-qing CAI
Lin WANG
Acta Mathematicae Applicatae Sinica, 2020, 36 (03) : 620 - 626
[7] A Generalization of Implicit Ore-condition for Hamiltonicity ofk-connected Graphs
Cai, Jun-qing
Wang, Lin
ACTA MATHEMATICAE APPLICATAE SINICA-ENGLISH SERIES, 2020, 36 (03): : 620 - 626
[8] A Generalization of Implicit Ore-condition for Hamiltonicity of k-connected Graphs
Jun-qing Cai
Lin Wang
Acta Mathematicae Applicatae Sinica, English Series, 2020, 36 : 620 - 626
[9] Implicit degree condition for hamiltonicity of graphs
Huang, Xing
ARS COMBINATORIA, 2016, 125 : 381 - 392
[10] An Implicit Degree Condition for Cyclability in Graphs
Li, Hao
Ning, Wantao
Cai, Junqing
FRONTIERS IN ALGORITHMICS AND ALGORITHMIC ASPECTS IN INFORMATION AND MANAGEMENT, (FAW-AAIM 2011), 2011, 6681 : 82 - 89

← 1 2 3 4 5 →