15-344/Classnotes for Thursday September 17
From Drorbn
Scanned Lecture Notes for September 17
(Files not beginning with "15-344" were deleted).
Lecture Notes for September 17
DEFINITION 7 Isomorphism A graph
is called isomorphic to a graph
whenever
there exists a bijection
such that
we have
if and
only if
.
means they are isomorphic to each other.
- A bijection is a one-to-one and on-to function. https://en.wikipedia.org/wiki/Bijection,_injection_and_surjection
- Isomorphism does not mean two things are identical but mathematically the same.
The relationship of isomorphisms:
1. Reflexive:
A graph is isomorphic to itself
2. Symmetric:
In other words, for every
we have
3. Transitive:
-cubes