1 Answers

In graph theory, two graphs G {\displaystyle G} and G ′ {\displaystyle G'} are homeomorphic if there is a graph isomorphism from some subdivision of G {\displaystyle G} to some subdivision of G ′ {\displaystyle G'}. If the edges of a graph are thought of as lines drawn from one vertex to another , then two graphs are homeomorphic to each other in the graph-theoretic sense precisely if they are homeomorphic in the topological sense.

6 views

Related Questions

What is Ordered graph?
1 Answers 5 Views
What is Half graph?
1 Answers 4 Views
What is Pancyclic graph?
1 Answers 4 Views
What is Subhamiltonian graph?
1 Answers 5 Views
What is st-planar graph?
1 Answers 4 Views
What is Permutation graph?
1 Answers 4 Views
What is End (graph theory)?
1 Answers 4 Views