(definition)
Definition: Two graphs are homeomorphic if they can be made isomorphic by inserting new vertices of degree 2 into edges.
Note: This corresponds to the topological notion since adding or removing degree 2 vertices doesn't change the graph's topology.
This is similar to, but not the same as, homomorphic.
Author: PEB
Eric Weisstein's MathWorld entries for homomorphism and homeomorphism.
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified Fri Dec 17 12:28:12 2004.
HTML page formatted Wed Oct 26 09:47:36 2005.
Cite this as:
Paul E. Black, "homeomorphic", from
Dictionary of Algorithms and Data
Structures, Paul E. Black, ed.,
NIST.
http://www.nist.gov/dads/HTML/homeomorphic.html
