The $K_{1,2}$-structure-connectivity of graphs
Combinatorics
2024-03-14 v2
Abstract
In this paper, we mainly investigate -structure-connectivity for any connected graph. Let be a connected graph with vertices, we show that is well-defined if , or , or when , or there exist three vertices such that when . Furthermore, if has -structure-cut, we prove .
Keywords
Cite
@article{arxiv.2403.06752,
title = {The $K_{1,2}$-structure-connectivity of graphs},
author = {Xiao Zhao and Haojie Zheng and Hengzhe Li},
journal= {arXiv preprint arXiv:2403.06752},
year = {2024}
}
Comments
18 pages,15 figures