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

DOI10.1016/j.dam.2023.06.009zbMath1529.05098OpenAlexW4381888917MaRDI QIDQ6064832

Jiadong Wu, Yi-Sai Xue, Li-ying Kang

Publication date: 11 December 2023

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

Full work available at URL: https://doi.org/10.1016/j.dam.2023.06.009

zbMATH Keywords

stabilityspectral radiusclique\(k\)-leaf-connected

Mathematics Subject Classification ID

Trees (05C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Connectivity (05C40)

Cites Work

• Hamilton connected graphs
• On k-leaf-connected graphs
• A method in graph theory
• The spectral radius of graphs on surfaces
• A sharp upper bound of the spectral radius of graphs
• Signless Laplacian spectral conditions for Hamilton-connected graphs with large minimum degree
• Maximizing the number of cliques in graphs with given matching number
• Improved sufficient conditions for \(k\)-leaf-connected graphs
• Spectral conditions for graphs to be \(k\)-Hamiltonian or \(k\)-path-coverable
• Some sufficient spectral conditions on Hamilton-connected and traceable graphs
• Merging the A-and Q-spectral theories
• n-Hamiltonian graphs
• Spectral radius and Hamiltonicity of graphs