Spectral radius and Hamiltonicity of graphs with large minimum degree

Title:

Spectral radius and Hamiltonicity of graphs with large minimum degree

Creator:

Nikiforov, Vladimir

Identifier:

https://cdk.lib.cas.cz/client/handle/uuid:9c71f80f-606d-40e6-abe0-6b0c1cbffa50
uuid:9c71f80f-606d-40e6-abe0-6b0c1cbffa50
issn:0011-4642

Subject:

matematika, mathematics, Hamiltonian cycle, Hamiltonian path, minimum degree, spectral radius, 13, and 51

Type:

model:article and TEXT

Format:

print, bez média, and svazek

Description:

Let G be a graph of order n and λ(G) the spectral radius of its adjacency matrix. We extend some recent results on sufficient conditions for Hamiltonian paths and cycles in G. One of the main results of the paper is the following theorem Let k \geqslant 2, n \geqslant k^{3} + k + 4, and let G be a graph of order n, with minimum degree δ(G) \geqslant k. If \lambda \left( G \right) \geqslant n - k - 1, then G has a Hamiltonian cycle, unless G=K_{1}\vee (K_{n-k-1}+K_{k}) or G=K_{k}\vee (K_{n-2k}+\bar{K}_{k})., Vladimir Nikiforov., and Obsahuje seznam literatury

Language:

English

Rights:

http://creativecommons.org/publicdomain/mark/1.0/
policy:public

Coverage:

925-940

Source:

Czechoslovak Mathematical Journal | 2016 Volume:66 | Number:3

Harvested from:

CDK

Metadata only:

false