| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 5773053 | Linear Algebra and its Applications | 2017 | 17 Pages |
Abstract
By a unified approach, we present sufficient conditions based on spectral radius for a graph to be k-connected, k-edge-connected, k-Hamiltonian, k-edge-Hamiltonian, β-deficient and k-path-coverable.
Related Topics
Physical Sciences and Engineering
Mathematics
Algebra and Number Theory
Authors
Lihua Feng, Pengli Zhang, Henry Liu, Weijun Liu, Minmin Liu, Yuqin Hu,