Index: A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

Home > Homeomorphism (graph theory)

A homeomorphism in graph theory exists between two graphs G and G′ if there exists a graph that can be found from subdivision of edges in that graph. If the edges of a graph are thought of as lines drawn from one vertex to another (as they are usually depicted in illustrations), then two graphs are homeomorphic to each other in the present sense precisely if they are homeomorphic in the sense in which the term is used in topology.

Subdivision means that if we have an edge e={u, w}, we insert a new vertex v and divide e into two edges {u, v} and {v, w}.

For example, if we have the graph G₁

*--*--*--*--*

and G₂

*--*--*--*

these two graphs are homeomorphic since if we have the graph:

*---*---* x y

subdividing edge x gives G₂, and subdividing x and y gives G₁.

<Hide>

Topics: Homeomorphism (graph Theory)...

HomeomorphismThis word should not be confused with homomorphism. In topology, two geometrical objects (or "spaces") are called homeomorphic if, roughly speaking, the first can be deformed into the second by stretching and bending; cutting is also allowed, but only if

Homeomorphism (graph theory)A homeomorphism in graph theory exists between two graphs G and G prime; if there exists a graph that can be found from subdivision of edges in that graph. If the edges of a graph are thought of as lines drawn from one vertex to another (as they are usual

Non User