The D-neighborhood complex of a graph
Date
2014
Authors
Previte, Corrine, author
Peterson, Chris, advisor
Hulpke, Alexander, advisor
Bates, Dan, committee member
Gelfand, Martin, committee member
Journal Title
Journal ISSN
Volume Title
Abstract
The Neighborhood complex of a graph, G, is an abstract simplicial complex formed by the subsets of the neighborhoods of all vertices in G. The construction of this simplicial complex can be generalized to use any subset of graph distances as a means to form the simplices in the associated simplicial complex. Consider a simple graph G with diameter d. Let D be a subset of {0,1,..., d}. For each vertex, u, the D-neighborhood is the simplex consisting of all vertices whose graph distance from u lies in D. The D-neighborhood complex of G, denoted DN(G,D), is the simplicial complex generated by the D-neighborhoods of vertices in G. We relate properties of the graph G with the homology of the chain complex associated to DN(G,D).
Description
Rights Access
Subject
combinatorics
graph theory
homology
simplicial complex
topology