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: | Liu Weijun, Liu Minmin, Zhang Pengli, Feng Lihua |
---|---|
Format: | Article |
Language: | English |
Published: |
Sciendo
2020-02-01
|
Series: | Discussiones Mathematicae Graph Theory |
Subjects: | |
Online Access: | https://doi.org/10.7151/dmgt.2127 |
Similar Items
-
Spectral Radius and Hamiltonicity of Graphs
by: Yu Guidong, et al.
Published: (2019-11-01) -
On the Distance Spectral Radius of Trees with Given Degree Sequence
by: Dadedzi Kenneth, et al.
Published: (2020-05-01) -
Decomposing the Complete Graph Into Hamiltonian Paths (Cycles) and 3-Stars
by: Lee Hung-Chih, et al.
Published: (2020-08-01) -
Hamiltonian and Pancyclic Graphs in the Class of Self-Centered Graphs with Radius Two
by: Hrnčiar Pavel, et al.
Published: (2018-08-01) -
Hamiltonian Cycle Problem in Strong k-Quasi-Transitive Digraphs With Large Diameter
by: Wang Ruixia
Published: (2021-05-01)