Please wait a minute...
AMJCUB
Applied Mathematics-A Journal of Chinese Universities  2019, Vol. 34 Issue (2): 162-    DOI: 10.1007/s11766-019-3565-9
    
Wiener Index, Hyper-Wiener Index, Harary Index and Hamiltonicity Properties of graphs
YU Gui-dong, REN Li-fang, LI Xing-xing
1 School of Mathmatics and Computation Sciences, Anqing Normal University, Anqing 246133,China.
2 Basic Department, Hefei Preschool Education College, Hefei 230013, China.
Download: PDF 
Export: BibTeX | EndNote (RIS)      

Abstract  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.

Key words： Wiener index      Hyper-Wiener index      Harary index, Traceable      Hamilton-connected      Traceable for every vertex     
Published: 02 July 2019
CLC:  05C50  
  15A18  
Service
E-mail this article
Add to my bookshelf
Add to citation manager
E-mail Alert
RSS
Articles by authors
YU Gui-dong
REN Li-fang
LI Xing-xing
Cite this article:

YU Gui-dong, REN Li-fang, LI Xing-xing. Wiener Index, Hyper-Wiener Index, Harary Index and Hamiltonicity Properties of graphs. Applied Mathematics-A Journal of Chinese Universities, 2019, 34(2): 162-.

URL:

http://www.zjujournals.com/amjcub/10.1007/s11766-019-3565-9     OR     http://www.zjujournals.com/amjcub/Y2019/V34/I2/162


Wiener Index, Hyper-Wiener Index, Harary Index and Hamiltonicity Properties of graphs

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 
No related articles found!