NEIGHBORHOOD UNIONS AT DISTANCE TWO AND HAMILTONICITY OF GRAPHS

NEIGHBORHOOD UNIONS AT DISTANCE TWO AND HAMILTONICITY OF GRAPHS

导出

摘要 Let G=(V, E) be an undirected graph of order n. If G has a Hamiltonian cycle (a cycle containing every vertex of G), then G is called Hamiltonian.

作者刘新张莲珠朱永津

机构地区 Institute of Systems Science Department of Mathematics

出处《Chinese Science Bulletin》 SCIE EI CAS 1992年第18期1582-1582,共1页

关键词 undirected HAMILTONIAN VERTEX connected cycle 子全二凡日式成和

1李明楚,刘振宏.EDGE-DISJOINT HAMILTONIAN CYCLES IN GRAPHS[J].Chinese Science Bulletin,1991,36(12):1055-1056.
2Hamiltonicity Quasi-locally Connected G of Claw-Free Graphs[J].Systems Science and Systems Engineering,1997,7(4):129-130.
3杨丽娟.清末地质学的传入——以日式地质学教科书为中心[J].自然科学史研究,2016,35(3):311-319.
4毛经中.THE GENERALIZATION OF BECKENBACH INEQUALITY AND MALFATTI INEQUALITY[J].Chinese Science Bulletin,1992,37(2):175-176.
5施容华.THE AVERAGE DISTANCE OF A CONNECTED GRAPH[J].Chinese Science Bulletin,1991,36(4):348-348.
6HU Zhiquan Department of Mathematics, Huazhong Normal University,Wuhan 430070.Forbidden Subgraphs, Distance,and Hamiltonicity[J].Systems Science and Systems Engineering,1994,4(3):205-210.
7朱永津,高敬振.IMPLICIT DEGREES AND CHVATAL'S CONDITION FOR HAMILTONICITY[J].Systems Science and Mathematical Sciences,1989,2(4):353-363.
8田永成.NEW SUFFICIENT CONDITIONS OF THE LONGEST CYCLES OF 1-TOUGH GRAPHS[J].Chinese Science Bulletin,1991,36(3):261-262.
9刘一平,田丰,吴正声.A k-HAMILTON-NICE SEQUENCE[J].Chinese Science Bulletin,1992,37(18):1583-1583.
10刘一平.THE MAXIMUM NUMBER OF CHORDS OF A CYCLE IN K<sub>1.3</sub>-FREE GRAPHS[J].Chinese Science Bulletin,1990,35(8):700-700.

Chinese Science Bulletin

1992年第18期

浏览历史

内容加载中请稍等...