Improved sufficient conditions for k-leaf-connected graphs

DOI10.1016/J.DAM.2022.02.020MaRDI QIDQ2127608zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 20 April 2022

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

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

zbMATH Keywords

\(k\)-leaf-connected graphcomplementHamilton-connected graphsignless Laplacianspectral radius

Mathematics Subject Classification ID

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

Recommendations

• An improvement of sufficient condition for k-leaf-connected graphs
• On k-leaf-connected graphs
• A Fan-type condition for graphs to be \(k\)-leaf-connected
• Wiener-type invariants and \(k\)-leaf-connected graphs
• Some sufficient conditions on \(k\)-connected graphs

Cites work

• A method in graph theory
• A sharp upper bound of the spectral radius of graphs
• Graph theory
• scientific article; zbMATH DE number 1600999 (Why is no real title available?)
• Interlacing eigenvalues and graphs
• Note on Hamilton Circuits
• On k-leaf-connected graphs
• On three conjectures involving the signless Laplacian spectral radius of graphs
• Signless Laplacian spectral conditions for Hamilton-connected graphs with large minimum degree
• Signless Laplacian spectral radius and Hamiltonicity
• Some Inequalities for the Largest Eigenvalue of a Graph
• Some sufficient spectral conditions on Hamilton-connected and traceable graphs
• Spectral analogues of Erdős' theorem on Hamilton-connected graphs
• Spectral Radius and Degree Sequence
• Sufficient conditions for Hamilton-connected graphs in terms of (signless Laplacian) spectral radius

Cited in

(14)

• On k-leaf-connected graphs
• The connectivities of leaf graphs of 2-connected graphs
• Some sufficient conditions on \(k\)-connected graphs
• A Fan-type condition for graphs to be \(k\)-leaf-connected
• Wiener-type invariants and \(k\)-leaf-connected graphs
• An improvement of sufficient condition for k-leaf-connected graphs
• Onk-leaf connectivity of a random graph
• Some sufficient conditions for graphs being k-leaf-connected
• Sufficient conditions for k-leaf-connected graphs in terms of the first Zagreb index, the reciprocal degree distance and the forgotten topological index
• Some sufficient conditions for graphs to be k-leaf-connected
• On sufficient conditions for k-leaf-connected graphs
• Sufficient conditions for L-leaf-connected graphs in terms of the inverse index, the reciprocal product-degree distance, and the multiplicative version of the first Zagreb index
• Results on k-leaf-connected graphs and digraphs: a survey
• Eigenvalues and factors: a survey

This page was built for publication: Improved sufficient conditions for \(k\)-leaf-connected graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2127608)