中文

图的顶点割与其邻域复形的连通性

组合数学 2023-04-27 v2

摘要

我们证明,若图GG满足特定条件,则邻域复形N(G)\mathcal{N}(G)的连通性严格小于GG的顶点连通性。作为一个应用,我们给出了刚性弦图以及满足特定性质的弱三角化图的邻域复形连通性与顶点连通性之间的关系。进一步,我们证明:对于图GG,若存在顶点vv满足如下性质,即对vv的邻居的任意kk元子集SS,存在顶点vSvv_S \neq v使得SSvSv_S的邻居的子集,则N(G{v})\mathcal{N}(G-\{v\})(k1)(k-1)-连通蕴含N(G)\mathcal{N}(G)(k1)(k-1)-连通。由此我们证明:(i) 皇后图与国王图的邻域复形是单连通的;(ii) 若GG(n+1)(n+1)-连通弦图且不被折叠到大小为n+2n+2的团上,则N(G)\mathcal{N}(G)nn-连通的。

关键词

引用

@article{arxiv.2002.03527,
  title  = {Vertex cut of a graph and connectivity of its neighbourhood complex},
  author = {Rekha Santhanam and Samir Shukla},
  journal= {arXiv preprint arXiv:2002.03527},
  year   = {2023}
}

备注

Accepted journal version. Incorporated referee's comments. In section 6, an example of a class of graphs is added, where the connectivity of its neighborhood complex can be made arbitrary large from its vertex connectivity