arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2211.04778math.CO
收藏

$k$ -叶-连通图充分条件的改进

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

Tingyan Ma, Guoyan Ao, Ruifang Liu, Ligong Wang, Yang Hu

摘要:

对于整数$k\geq2,$,一个图$G$称为$k$ -叶连通的,如果$|V(G)|\geq k+1$和给定的任何子集$S\subseteq V(G)$与$|S|=k,$ $G$总是有一个生成树$T$,使得$S$恰好是$T.$的叶的集合因此一个图是$2$ -叶连通的当且仅当它是Hamilton连通的。本文给出了一个基于图的大小的最佳可能条件,它不仅改进了Gurgel和Wakabayashi [On $k$ -leaf-连通图,J. Combin. Theory Ser.B41(1986)1-16]和Ao,Liu,Yuan和Li [Improved Sufficient Conditions for $k$ -leaf-连通图,Discrete Appl.Math.314(2022)17-30]的结果,而且还推广了Xu,Zhai和Wang [An improvement of spectral conditions for Hamilton-连通图,Linear Multilinear Algebra,2021]的结果。我们的主要方法是证明一个$(n+k-1)$ -闭非$k$ -叶连通图如果其大小足够大,则必包含一个大团.作为应用,给出了图是$k$ -叶连通图的充分条件,这些条件是由$G$或其补图的(无符号Laplacian)谱半径决定的.

英文摘要:

For integer $k\geq2,$ a graph $G$ is called $k$-leaf-connected if $|V(G)|\geq k+1$ and given any subset $S\subseteq V(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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑