Try Magic Notes and save time.Try it free
Try Magic Notes and save timeCrush your year with the magic of personalized studying.Try it free
Question

Show that isomorphism of simple graphs is an equivalence relation.

Solution

Verified
Step 1
1 of 4

DEFINITIONS

Two simple graphs $G_1=(V_1,E_1)$ and $G_2=(V_2,E_2)$ are $\textbf{isomorphic}$ if there exists a one-to-one and onto function $f:V_1\rightarrow V_2$ such that $a$ and $b$ are adjacent in $G_1$ if and only if $f(a)$ and $f(b)$ are adjacent in $G_2$.

A relation $R$ is an $\textbf{equivalence relation}$ if the relation $R$ is transitive, symmetric and reflexive.

A relation $R$ on a set $A$ is $\textbf{reflexive}$ if $(a,a)\in R$ for every element $a\in A$.

A relation $R$ on a set $A$ is $\textbf{symmetric}$ if $(b,a)\in R$ whenever $(a,b) \in R$

A relation $R$ on a set $A$ is $\textbf{transitive}$ if $(a,b)\in R$ and $(b,c) \in R$ implies $(a,c)\in R$

Recommended textbook solutions

Discrete Mathematics and Its Applications

7th EditionISBN: 9780073383095Kenneth Rosen
4,283 solutions

Discrete Mathematics

8th EditionISBN: 9780321964687 (2 more)Richard Johnsonbaugh
4,246 solutions

Discrete Mathematics and Its Applications

8th EditionISBN: 9781259676512Kenneth Rosen
4,397 solutions

Discrete Mathematics with Applications

5th EditionISBN: 9781337694193Susanna S. Epp
2,641 solutions