Vertex cut of a graph and connectivity of its neighbourhood complex

From MaRDI portal
Publication:6041558



Abstract: We show that if a graph G satisfies certain conditions then the connectivity of neighbourhood complex mathcalN(G) is strictly less than the vertex connectivity of G. As an application, we give a relation between the connectivity of the neighbourhood complex and the vertex connectivity for stiff chordal graphs, and for weakly triangulated graphs satisfying certain properties. Further, we prove that for a graph G if there exists a vertex v satisfying the property that for any k-subset S of neighbours of v, there exists a vertex vSeqv such that S is subset of neighbours of vS, then mathcalN(G−v) is (k−1)-connected implies that mathcalN(G) is (k−1)-connected. As a consequence of this, we show that:(i) neighbourhood complexes of queen and king graphs are simply connected and (ii) if G is a (n+1)-connected chordal graph which is not folded onto a clique of size n+2, then mathcalN(G) is n-connected.












This page was built for publication: Vertex cut of a graph and connectivity of its neighbourhood complex

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6041558)