Professional Documents
Culture Documents
Nitin Upadhyay
February 27, 2006
Bits-Pilani Goa campus
Discussion
What is a Graph?
Applications of Graphs
Categorization
Terminology
Special Graph Structures
Cycles Cn
Wheels Wn
n-Cubes Qn
Bipartite graphs
Complete bipartite graphs Km,n
Graph Representations
Adjacency-matrix representation
Incidence matrix representation
Edge-set representation
Adjacency-set representation
Adjacency List
Graph Isomorphism
Formal definition:
Simple graphs G1=(V1, E1) and G2=(V2, E2) are
isomorphic if there is a function f:V1→V2 such that
f is one-to-one .
f is onto, and
∀ a,b∈V1, a and b are adjacent in G1 iff f(a) and
f(b) are adjacent in G2.
f is the “renaming” function that makes the two
graphs identical.
Graph Invariants under
Isomorphism
Necessary but not sufficient conditions for
G1=(V1, E1) to be isomorphic to G2=(V2, E2):
|V1|=|V2|, |E1|=|E2|.
The number of vertices with degree n is the same
in both graphs.
For every proper subgraph g of one graph, there
is a proper subgraph of the other graph that is
isomorphic to g.
Isomorphism Example
b d * Same # of
vertices
a b a* Same # of
d c
edges
e•Same # of
e c f degrees for
f all vertices
Hence, they are isomorphic!
Are These Isomorphic?
G H
Spanning Subgraph
G H
Connectivity
d e d f d e f
G1 G2 G1 ∪ G2
Questions
Questions ?