The Clique Number and Some Hamiltonian Properties of Graphs

IF 0.4 4区数学 Q4 MATHEMATICS

Contributions To Discrete Mathematics Pub Date : 2021-08-21 DOI:10.47443/cm.2021.0038

Rao Li

引用次数: 0

Abstract

Abstract A graph is said to be Hamiltonian (respectively, traceable) if it has a Hamiltonian cycle (respectively, Hamiltonian path), where a Hamiltonian cycle (respectively, Hamiltonian path) is a cycle (respectively, path) containing all the vertices of the graph. In this short note, sufficient conditions involving the clique number for the Hamiltonian and traceable graphs are presented.

查看原文本刊更多论文

图的团数和一些哈密顿性质

如果一个图有一个哈密顿循环(哈密顿路径)，那么这个图就是哈密顿循环(哈密顿路径)，其中哈密顿循环(哈密顿路径)是一个包含图中所有顶点的循环(哈密顿路径)。本文给出了哈密顿图和可迹图的团数存在的充分条件。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Contributions To Discrete Mathematics MATHEMATICS-

CiteScore

1.30

自引率

0.00%

发文量

期刊介绍： Contributions to Discrete Mathematics (ISSN 1715-0868) is a refereed e-journal dedicated to publishing significant results in a number of areas of pure and applied mathematics. Based at the University of Calgary, Canada, CDM is free for both readers and authors, edited and published online and will be mirrored at the European Mathematical Information Service and the National Library of Canada.