| Article ID | Journal | Published Year | Pages | File Type | 
|---|---|---|---|---|
| 4949597 | Discrete Applied Mathematics | 2017 | 12 Pages | 
Abstract
												Finding sufficient conditions for some properties of graphs in light of quantitative methods is an important problem. In this paper, in terms of the Wiener index or Harary index, we present several sufficient conditions for a graph to be k-connected, β-deficient, k-hamiltonian, k-path-coverable or k-edge-hamiltonian.
											Related Topics
												
													Physical Sciences and Engineering
													Computer Science
													Computational Theory and Mathematics
												
											Authors
												Lihua Feng, Xiaomin Zhu, Weijun Liu, 
											