Research on Hamilton Graph Discrimination

机译：哈密顿图判别研究

获取原文

页面导航

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

摘要

In this paper, many ordinary graphs are subjected to Hamilton graph discrimination by using some necessary conditions and sufficient conditions proposed by many researchers in the past, and features of peaks (V), sides (E) and planes(r) of each graph are analyzed. In the same time, regulations including V = E and Hamilton circle divides into two planes: internal (yin) plane and external (yang) plane, i.e. r = 2, after planar embedding. And then a necessary and sufficient condition and its proving for discriminating Hamilton graph is find out. Some instances of discrimination are also presented.

机译：本文利用过去许多研究人员提出的一些必要条件和充分条件对许多普通图进行汉密尔顿图判别，并且各图的峰（V），边（E）和平面（r）的特征是分析。同时，将V = E和汉密尔顿圆的规则分为两个平面：内部（阴）平面和外部（阳）平面，即平面嵌入后r = 2。然后找出判别汉密尔顿图的充要条件及其证明。还介绍了一些歧视实例。

著录项

来源
《Third International Symposium on Information Processing》|2010年|p.113-116|共4页
会议地点
作者
Cui Yan; Cui Chao-Dong;
展开▼
作者单位

展开▼
会议组织
原文格式 PDF
正文语种
中图分类信息与传播理论;
关键词
Euler's formula; Hamilton circle; Hamilton graph; closed domain; connected graph; necessary and sufficient condition; planar graph;

机译：欧拉公式;哈密顿圆;哈密顿图;闭域;连通图;充要条件;平面图;

相似文献

外文文献
中文文献
专利

1. Powers of Hamilton cycles in random graphs and tight Hamilton cycles in random hypergraphs [J] . Nenadov Rajko, Skoric Nemanja Random structures & algorithms . 2019,第1期

机译：汉密尔顿周期的力量在随机图中，随机超图中的紧密汉密尔顿周期
2. DIRECTED HAMILTON CYCLES IN DIGRAPHS AND MATCHING ALTERNATING HAMILTON CYCLES IN BIPARTITE GRAPHS [J] . ZAN-BO ZHANG, XIAOYAN ZHANG, XUELIAN WEN SIAM Journal on Discrete Mathematics . 2013,第1期

机译：图中的汉密尔顿循环和双峰图匹配的交替汉密尔顿循环
3. Hamilton cycle and Hamilton path extendability of Cayley graphs on abelian groups [J] . ?tefko Miklavi?., Primo? ?parl. Journal of Graph Theory . 2012,第3a4期

机译：阿贝尔群上Cayley图的Hamilton循环和Hamilton路径可扩展性
4. Research on Hamilton Graph Discrimination [C] . Cui Yan, Cui Chao-Dong International Symposium on Information Processing . 2010

机译：汉密尔顿图歧视研究
5. On Hamilton Cycle Decompositions of Complete Multipartite Graphs Which Are Both Cyclic and Symmetric [D] . Akinola, Fatima A. 2021

机译：汉密尔顿循环的完整多重图循环分解，它们都是循环和对称的
6. Two-item discrimination and Hamilton search learning in infant pigtailed macaque monkeys [O] . James C. Ha, Dorothy J. Mandell, Jonathan Gray -1

机译：在婴儿辫子短尾猿猴子的两项歧视和汉密尔顿搜索学习
7. Bailey, T. Melville; Filer, Patricia; Fraser, Robert L.; and Weaver, John C, eds. Dictionary of Hamilton Biography. Volume I. Hamilton: Dictionary of Hamilton Biography, 1981. Pp. xii, 244. Maps, illustrations [O] . McCalla, Douglas 1983

机译：Bailey，T。melville; Filer，patricia;弗雷泽，罗伯特L.和Weaver，John C，编辑。汉密尔顿传记词典。第一卷。汉密尔顿：汉密尔顿传记词典，1981年。第Xii，244页。地图，插图
8. Criterion for Some Hamiltonian Graphs to Be Hamilton-Connected [R] . Asratian, A. S. 1993

机译：一类哈密顿图是Hamilton连通的判据

Research on Hamilton Graph Discrimination

摘要

著录项

相似文献

相关主题

期刊订阅