English

The $K_{1,2}$-structure-connectivity of graphs

Combinatorics 2024-03-14 v2

Abstract

In this paper, we mainly investigate K1,2K_{1,2}-structure-connectivity for any connected graph. Let GG be a connected graph with nn vertices, we show that κ(G;K1,2)\kappa(G; K_{1,2}) is well-defined if diam(G)4diam(G)\geq 4, or n1(mod3)n\equiv 1\pmod 3, or G{C5,Kn}G\notin \{C_{5},K_{n}\} when n2(mod3)n\equiv 2\pmod 3, or there exist three vertices u,v,wu,v,w such that NG(u)(NG(v,w){v,w})=N_{G}(u)\cap (N_{G}(v,w)\cup\{v,w\})=\emptyset when n0(mod3)n\equiv 0\pmod 3. Furthermore, if GG has K1,2K_{1,2}-structure-cut, we prove κ(G)/3κ(G;K1,2)κ(G)\kappa(G)/3\leq\kappa(G; K_{1,2})\leq\kappa(G).

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

R2 v1 2026-06-28T15:15:49.104Z