Long Cycles in 1-Tough Graphs With Large Degree Sums

被引：0
|
作者：
张莲珠
李建平
田丰
机构：
[1] Institute of Systems Science Academia Sinica Beijing 100080 PRC
[2] Department of Mathematics Yunnan University Kunming 650091 PRC
[3] Department of Mathematics Zhangzhou Normal College Zhangzhou 363000 PRC
来源：
Chinese Science Bulletin | 1993年 / 07期
关键词：
Long Cycles in 1-Tough Graphs With Large Degree Sums;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
For a graph G, we denote by c(G) the circumference of G, and let σ(G)=min{sum from i=1 to 3 d(v):{v, v, v} is an independent set in G},(G)=min{sum from i=1 to 3 d(v)-|N(v)|:{v, v, v} is an independent set in G}, ρ(G)=min{|N(v)|:{v, v, v} is an independent set in G} and
引用
收藏
页码：613 / 613
页数：1
相关论文
共 50 条
12345