首页> 美国政府科技报告 >Long Cycles in 2-Connected Graphs Containing All Vertices of Large Degree

【24h】

Long Cycles in 2-Connected Graphs Containing All Vertices of Large Degree

机译：包含所有大度顶点的2连通图中的长周期

获取原文

页面导航

摘要
著录项
相似文献
相关主题

摘要

Let G be a 2-connected graph of order n with minimum degree delta. It is shownthat G is hamiltonian or has a cycle of length at least 2 delta containing all vertices of degree at least n/2. Another result, is that if G is 3-connected, e = xy is a member of E(G) and n >= 2 delta, then there exists a cycle of length at

著录项

作者
Trommel, H.;
展开▼
作者单位

展开▼
年度 1996
页码 p.1-13
总页数 13
原文格式 PDF
正文语种 eng
中图分类工业技术;
关键词
Hamiltonian functions; Cycles; Vertex functions; Graph theory; Theorems; Theoremproving;

机译：哈密顿函数;周期;顶点函数;图论;定理;改进;

相似文献

外文文献
中文文献
专利

1. 2-Connected Hamiltonian Claw-Free Graphs Involving Degree Sum of Adjacent Vertices [J] . Tao Tian, Liming Xiong Discussiones Mathematicae Graph Theory . 2020,第1期

机译：包含顶点的和度的2连通哈密顿无爪图
2. An implicit degree condition for long cycles in 2-connected graphs [J] . Chen B, Zhang SG Applied mathematics letters . 2006,第11期

机译：2连通图中长周期的隐式条件
3. Forbidden subgraphs for longest cycles to contain vertices with large degrees [J] . Li Binlong, Zhang Shenggui Discrete mathematics . 2015,第10期

机译：最长子周期的禁止子图包含大角度的顶点
4. Heavy Cycles in 2-Connected Weighted Graphs with Large Weighted Degree Sums [C] . Bing Chen, Shenggui Zhang, T.C. Edwin Cheng Computational Science - ICCS 2007 pt.3; Lecture Notes in Computer Science; 4489 . 2007

机译：具有大加权度和的2连通加权图中的重循环
5. Finding a maximum clique of a chordal graph by removing vertices of minimum degree [D] . Bhaduri, Sudipta 2008

机译：通过删除最小度数的顶点来找到弦图的最大集团
6. Improving short-term information spreading efficiency in scale-free networks by specifying top large-degree vertices as the initial spreaders [O] . Shuangyan Wang, Yunfeng Deng, Ying Li 2018

机译：通过指定顶部大型顶点作为初始扩展器提高无标度网络中的短期信息传播效率
7. Heavy cycles in 2-connected weighted graphs with large weighted degree sums [O] . Chen, B, Zhang, S, Cheng, TCE 2007

机译：2个连接的加权图中具有大加权度和的重循环
8. Toughness and Longest Cycles in 2-Connected Planar Graphs [R] . Boehme, T., Broersma, H. J., Veldman, H. J. 1995

机译：2连通平面图中的韧性和最长周期

Long Cycles in 2-Connected Graphs Containing All Vertices of Large Degree

摘要

著录项

相似文献

相关主题

期刊订阅