An improvement of sufficient condition for k-leaf-connected graphs

DOI10.1016/J.DAM.2023.01.014arXiv2211.04778MaRDI QIDQ6416657FDOQ6416657

Authors: Tingyan Ma, Guoyan Ao, Rui-fang Liu, Ligong Wang, Yang Hu 

Publication date: 9 November 2022

Abstract: For integer $kgeq2,$ a graph $G$ is called $k$-leaf-connected if $|V(G)|geqk+1$ and given any subset $SsubseteqV(G)$ with $|S|=k,$ $G$ always has a spanning tree $T$ such that $S$ is precisely the set of leaves of $T.$ Thus a graph is $2$-leaf-connected if and only if it is Hamilton-connected. In this paper, we present a best possible condition based upon the size to guarantee a graph to be $k$-leaf-connected, which not only improves the results of Gurgel and Wakabayashi [On $k$-leaf-connected graphs, J. Combin. Theory Ser. B 41 (1986) 1-16] and Ao, Liu, Yuan and Li [Improved sufficient conditions for $k$-leaf-connected graphs, Discrete Appl. Math. 314 (2022) 17-30], but also extends the result of Xu, Zhai and Wang [An improvement of spectral conditions for Hamilton-connected graphs, Linear Multilinear Algebra, 2021]. Our key approach is showing that an $(n+k-1)$-closed non-$k$-leaf-connected graph must contain a large clique if its size is large enough. As applications, sufficient conditions for a graph to be $k$-leaf-connected in terms of the (signless Laplacian) spectral radius of $G$ or its complement are also presented.

Mathematics Subject Classification ID

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

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

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