Isomorphism Classes for Order 2 Simple Graphs

From ProofWiki
Jump to navigation Jump to search

Theorem

There are $2$ equivalence classes for simple graphs of order $2$ under graph isomorphism:

the edgeless graph of order $2$

and

the complete graph of order $2$.


Proof


Sources