Vertex cut of a graph and connectivity of its neighbourhood complex
From MaRDI portal
Publication:6041558
Abstract: We show that if a graph satisfies certain conditions then the connectivity of neighbourhood complex is strictly less than the vertex connectivity of . 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 if there exists a vertex satisfying the property that for any -subset of neighbours of , there exists a vertex such that is subset of neighbours of , then is -connected implies that is -connected. As a consequence of this, we show that:(i) neighbourhood complexes of queen and king graphs are simply connected and (ii) if is a -connected chordal graph which is not folded onto a clique of size , then is -connected.
Recommendations
Cites work
- Circular chromatic numbers of Mycielski's graphs
- Combinatorial algebraic topology
- Complexes of graph homomorphisms
- Graph theory
- Homotopy types of box complexes
- Homotopy types of box complexes of chordal graphs
- scientific article; zbMATH DE number 5704224 (Why is no real title available?)
- scientific article; zbMATH DE number 863503 (Why is no real title available?)
- Kneser's conjecture, chromatic number, and homotopy
- Weakly triangulated graphs
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)