期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
Wiener Index, Hyper-Wiener Index, Harary Index and Hamiltonicity Properties of graphs
1
作者 YU Gui-dong REN Li-fang LI Xing-xing 《Applied Mathematics(A Journal of Chinese Universities)》 SCIE CSCD 2019年第2期162-172,共11页
In this paper, in terms of Wiener index, hyper-Wiener index and Harary index, we first give some sufficient conditions for a nearly balance bipartite graph with given minimum degree to be traceable. Secondly, we estab... In this paper, in terms of Wiener index, hyper-Wiener index and Harary index, we first give some sufficient conditions for a nearly balance bipartite graph with given minimum degree to be traceable. Secondly, we establish some conditions for a k-connected graph to be Hamilton-connected and traceable for every vertex, respectively. 展开更多
关键词 WIENER INDEX Hyper-Wiener INDEX Harary INDEX TRACEABLE hamilton-connected TRACEABLE for EVERY VERTEX
下载PDF
TWO NEW SUFFICIENT CONDITIONS FOR HAMILTON-CONNECTED GRAPHS
2
作者 吴正声 《Acta Mathematicae Applicatae Sinica》 SCIE CSCD 1995年第1期44-50,共7页
Let G be a 3-connected graph with n vertices, is an independent set of G} , MC(G)=min is an independent set in G}.In this paper, the main results are as follows.TheoremⅠ. If then G is Hamilton-connected.TheoremⅡ. If... Let G be a 3-connected graph with n vertices, is an independent set of G} , MC(G)=min is an independent set in G}.In this paper, the main results are as follows.TheoremⅠ. If then G is Hamilton-connected.TheoremⅡ. If, then G is Hamilton-connected.Theorems I and IIare the best possible, and are incomparable in the sense that neither theorem implies the other. 展开更多
关键词 connected graph hamilton-connectED
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部