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

Figures and Topics from this paper.

Citations

Publications citing this paper.

References

Publications referenced by this paper.
SHOWING 1-10 OF 17 REFERENCES

Algebraic Topology, McGraw-Hill, New York, 1966

E. H. Spanier
  • Discrete Mathematics
  • 2001

The Euler formula of cyclomatic numbers of hypergraphs

T. T. Lee
  • Southeast Asian Bull. Math
  • 1997
VIEW 1 EXCERPT

An invariant for hypergraphs

Jianfang Wang, Tony T. Lee
  • 1996
VIEW 1 EXCERPT

An information-theoretic analysis of relational databases—Part 2: information structures of database schemes

T. T. Lee
  • IEEE Trans. Software Eng
  • 1987
VIEW 1 EXCERPT