Spectral analogues of Erdős' theorem on Hamilton-connected graphs
type: Item
instance of: scholarly article
title: Spectral analogues of Erdős' theorem on Hamilton-connected graphs
zbMATH Open document ID: 1428.05206
author: Jia Wei
author: Zhifu You
author: Hong-Jian Lai
published in: Applied Mathematics and Computation
publication date: 2019-11-22T00:00:00Z
Mathematics Subject Classification ID: 05C50
Mathematics Subject Classification ID: 05C45
zbMATH DE Number: 7135081
zbMATH Keywords: spectral radius
zbMATH Keywords: Hamilton-connected
zbMATH Keywords: minimum degree
MaRDI profile type: Publication
full work available at URL: j.amc.2018.08.005
OpenAlex ID: W2890665878
cites work: Q5668821
cites work: A method in graph theory
cites work: Q5422499
cites work: On a conjecture of V. Nikiforov
cites work: Q4327350
cites work: Some Theorems on Abstract Graphs
cites work: Q5722820
cites work: On maximal paths and circuits of graphs
cites work: A sharp upper bound of the spectral radius of graphs
cites work: On graphs with randomly deleted edges
cites work: Some Inequalities for the Largest Eigenvalue of a Graph
cites work: Spectral radius and Hamiltonicity of graphs with large minimum degree
cites work: Arc coverings of graphs
cites work: Hamilton connected graphs
cites work: The number of edges, spectral radius and Hamilton-connectedness of graphs
DOI: 10.1016/J.AMC.2018.08.005
description: scientific article; zbMATH DE number 7135081