Homeomorphism (graph theory)
id:
homeomorphism-graph-theory-188-8774457
title:
Homeomorphism (graph theory)
text:
In graph theory, two graphs G and G ′ are homeomorphic if there is a graph isomorphism from some subdivision of G to some subdivision of 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 their diagrams are homeomorphic in the topological sense.
brand slug:
wiki
category slug:
encyclopedia
description:
Concept in graph theory
original url:
https://en.wikipedia.org/wiki/Homeomorphism_(graph_theory)
date created:
2003-10-30T10:35:40Z
date modified:
2024-09-09T03:31:05Z
main entity:
{"identifier":"Q584521","url":"https://www.wikidata.org/entity/Q584521"}
image:
fields total:
13
integrity:
15