Graph homotopy and Graham homotopy
@article{Chen2001GraphHA, title={Graph homotopy and Graham homotopy}, author={Beifang Chen and Shing-Tung Yau and Yeong-Nan Yeh}, journal={Discrete Mathematics}, year={2001}, volume={241}, pages={153-170} }
Abstract Simple-homotopy for cell complexes is a special type of topological homotopy constructed by elementary collapses and elementary expansions. In this paper, we introduce graph homotopy for graphs and Graham homotopy for hypergraphs and study the relation between the two homotopies and the simple-homotopy for cell complexes. The graph homotopy is useful to describe topological properties of discretized geometric figures, while the Graham homotopy is essential to characterize acyclic… CONTINUE READING
Citations
Publications citing this paper.
SHOWING 1-10 OF 46 CITATIONS
The Lusternik-Schnirelmann theorem for graphs
VIEW 5 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED
Simplicial simple-homotopy of flag complexes in terms of graphs
VIEW 9 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED
ON THE SIMPLICIAL COMPLEX STEMMED FROM A DIGITAL GRAPH
VIEW 5 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED
1 2 Fe b 20 19 k-dismantlability in graphs
VIEW 1 EXCERPT
CITES BACKGROUND
The energy of a simplicial complex
VIEW 1 EXCERPT
CITES METHODS
k-Dismantlability in Graphs
VIEW 1 EXCERPT
CITES BACKGROUND
Path homology theory of multigraphs and quivers
VIEW 1 EXCERPT
CITES METHODS
The geometric realization of regular path complexes via (co-)homology.
VIEW 1 EXCERPT
CITES BACKGROUND
References
Publications referenced by this paper.
SHOWING 1-10 OF 17 REFERENCES
Algebraic Topology, McGraw-Hill, New York, 1966
The Euler formula of cyclomatic numbers of hypergraphs
VIEW 1 EXCERPT
An invariant for hypergraphs
VIEW 1 EXCERPT
An information-theoretic analysis of relational databases—Part 2: information structures of database schemes
VIEW 1 EXCERPT