Signless Laplacian spectral conditions for Hamilton-connected graphs with large minimum degree

TL;DR

This paper establishes a spectral condition based on the signless Laplacian spectral radius that guarantees a graph with large minimum degree is Hamilton-connected, advancing spectral graph theory.

Contribution

It introduces a new spectral criterion involving the signless Laplacian spectral radius for Hamilton-connectedness in graphs with large minimum degree.

Findings

Spectral condition ensures Hamilton-connectedness

Signless Laplacian spectral radius threshold identified

Applicable to graphs with large minimum degree

Abstract

In this paper, we present a spectral sufficient condition for a graph to be Hamilton-connected in terms of signless Laplacian spectral radius with large minimum degree.