An improvement of sufficient condition for \(k\)-leaf-connected graphs

DOI10.1016/J.DAM.2023.01.014OpenAlexW4317805997MaRDI QIDQ2691562

Yang Hu, Tingyan Ma, Guoyan Ao, Li-Gong Wang, Rui-fang Liu

Publication date: 29 March 2023

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2211.04778

zbMATH Keywords

spectral radiusclosuresignless LaplaciancomplementHamilton-connected\(k\)-leaf-connected

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Related Items (1)

Some sufficient conditions for graphs to be \(k\)-leaf-connected

Cites Work

• Unnamed Item
• Unnamed Item
• Ramsey-type theorems
• On k-leaf-connected graphs
• A method in graph theory
• The number of edges, spectral radius and Hamilton-connectedness of graphs
• A sharp upper bound of the spectral radius of graphs
• Interlacing eigenvalues and graphs
• Signless Laplacian spectral conditions for Hamilton-connected graphs with large minimum degree
• Spectral analogues of Erdős' theorem on Hamilton-connected graphs
• Improved sufficient conditions for \(k\)-leaf-connected graphs
• Sufficient conditions for Hamilton-connected graphs in terms of (signless Laplacian) spectral radius
• Some sufficient spectral conditions on Hamilton-connected and traceable graphs
• Some Inequalities for the Largest Eigenvalue of a Graph
• Note on Hamilton Circuits
• On three conjectures involving the signless Laplacian spectral radius of graphs

This page was built for publication: An improvement of sufficient condition for \(k\)-leaf-connected graphs