Spectral Conditions for Graphs to be k-Hamiltonian or k-Path-Coverable
A graph G is k-Hamiltonian if for all X ⊂ V (G) with |X| ≤ k, the subgraph induced by V (G) \ X is Hamiltonian. A graph G is k-path-coverable if V (G) can be covered by k or fewer vertex disjoint paths. In this paper, by making use of the vertex degree sequence and an appropriate closure concept (du...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Sciendo
2020-02-01
|
| Series: | Discussiones Mathematicae Graph Theory |
| Subjects: | |
| Online Access: | https://doi.org/10.7151/dmgt.2127 |
| id |
doaj-510f0b8be4f145c79168ff40a56e8e03 |
|---|---|
| record_format |
Article |
| spelling |
doaj-510f0b8be4f145c79168ff40a56e8e032021-09-05T17:20:24ZengSciendoDiscussiones Mathematicae Graph Theory2083-58922020-02-0140116117910.7151/dmgt.2127dmgt.2127Spectral Conditions for Graphs to be k-Hamiltonian or k-Path-CoverableLiu Weijun0Liu Minmin1Zhang Pengli2Feng Lihua3School of Mathematics and Statistics, Central South University, New Campus, Changsha, Hunan, 410083, P.R. ChinaSchool of Mathematics and Statistics, Central South University, New Campus, Changsha, Hunan, 410083, P.R. ChinaSchool of Mathematics and Statistics, Central South University, New Campus, Changsha, Hunan, 410083, P.R. ChinaSchool of Mathematics and Statistics, Central South University, New Campus, Changsha, Hunan, 410083, P.R. ChinaA graph G is k-Hamiltonian if for all X ⊂ V (G) with |X| ≤ k, the subgraph induced by V (G) \ X is Hamiltonian. A graph G is k-path-coverable if V (G) can be covered by k or fewer vertex disjoint paths. In this paper, by making use of the vertex degree sequence and an appropriate closure concept (due to Bondy and Chvátal), we present sufficient spectral conditions of a connected graph with fixed minimum degree and large order to be k-Hamiltonian or k-path-coverable.https://doi.org/10.7151/dmgt.2127spectral radiusminimum degreek-hamiltoniank-path-coverable05c5005c12 |
| collection |
DOAJ |
| language |
English |
| format |
Article |
| sources |
DOAJ |
| author |
Liu Weijun Liu Minmin Zhang Pengli Feng Lihua |
| spellingShingle |
Liu Weijun Liu Minmin Zhang Pengli Feng Lihua Spectral Conditions for Graphs to be k-Hamiltonian or k-Path-Coverable Discussiones Mathematicae Graph Theory spectral radius minimum degree k-hamiltonian k-path-coverable 05c50 05c12 |
| author_facet |
Liu Weijun Liu Minmin Zhang Pengli Feng Lihua |
| author_sort |
Liu Weijun |
| title |
Spectral Conditions for Graphs to be k-Hamiltonian or k-Path-Coverable |
| title_short |
Spectral Conditions for Graphs to be k-Hamiltonian or k-Path-Coverable |
| title_full |
Spectral Conditions for Graphs to be k-Hamiltonian or k-Path-Coverable |
| title_fullStr |
Spectral Conditions for Graphs to be k-Hamiltonian or k-Path-Coverable |
| title_full_unstemmed |
Spectral Conditions for Graphs to be k-Hamiltonian or k-Path-Coverable |
| title_sort |
spectral conditions for graphs to be k-hamiltonian or k-path-coverable |
| publisher |
Sciendo |
| series |
Discussiones Mathematicae Graph Theory |
| issn |
2083-5892 |
| publishDate |
2020-02-01 |
| description |
A graph G is k-Hamiltonian if for all X ⊂ V (G) with |X| ≤ k, the subgraph induced by V (G) \ X is Hamiltonian. A graph G is k-path-coverable if V (G) can be covered by k or fewer vertex disjoint paths. In this paper, by making use of the vertex degree sequence and an appropriate closure concept (due to Bondy and Chvátal), we present sufficient spectral conditions of a connected graph with fixed minimum degree and large order to be k-Hamiltonian or k-path-coverable. |
| topic |
spectral radius minimum degree k-hamiltonian k-path-coverable 05c50 05c12 |
| url |
https://doi.org/10.7151/dmgt.2127 |
| work_keys_str_mv |
AT liuweijun spectralconditionsforgraphstobekhamiltonianorkpathcoverable AT liuminmin spectralconditionsforgraphstobekhamiltonianorkpathcoverable AT zhangpengli spectralconditionsforgraphstobekhamiltonianorkpathcoverable AT fenglihua spectralconditionsforgraphstobekhamiltonianorkpathcoverable |
| _version_ |
1717786349423034368 |