Isomorphic Graphs

Topics: Graph Theory - Graph

---

(definition)

We say that two graphs $G$ and $G^{\prime }$ are isomorphic if:

1. Their number if vertices is the same.
2. Their number of edges is the same.
3. The connections between all their edges and vertices are the same.
4. Their hanging vertices are the same.

Isomorphic graphs may be represented graphically in different ways, so they may not seem isomorphic at first glance.

Digraphs §

Similarly, two digraphs are isomorphic if their subjacent graphs are isomorphic and the direction of all their arcs are the same.