Spectral conditions for graphs to be k-Hamiltonian or k-path-coverable | Zendy

Lihua Feng | Zendy; Minmin Liu | Zendy; Weijun Liu | Zendy; Pengli Zhang | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Spectral conditions for graphs to be k-Hamiltonian or k-path-coverable

Author(s) -

Lihua Feng,

Minmin Liu,

Weijun Liu,

Pengli Zhang

Publication year - 2018

Publication title -

discussiones mathematicae graph theory

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.476

H-Index - 19

eISSN - 2083-5892

pISSN - 1234-3099

DOI - 10.7151/dmgt.2127

Subject(s) - mathematics , combinatorics , path (computing) , hamiltonian path , discrete mathematics , graph , computer science , computer network

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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research