图的顶点割与其邻域复形的连通性
组合数学
2023-04-27 v2
摘要
我们证明,若图满足特定条件,则邻域复形的连通性严格小于的顶点连通性。作为一个应用,我们给出了刚性弦图以及满足特定性质的弱三角化图的邻域复形连通性与顶点连通性之间的关系。进一步,我们证明:对于图,若存在顶点满足如下性质,即对的邻居的任意元子集,存在顶点使得是的邻居的子集,则是-连通蕴含是-连通。由此我们证明:(i) 皇后图与国王图的邻域复形是单连通的;(ii) 若是-连通弦图且不被折叠到大小为的团上,则是-连通的。
引用
@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