
10-22 Discrete Mathematical Structures
Note 10.10 The necessary condition for the graph G and G′ to be isomorphic are as follows:
1. Both G and G′ have same number of vertices.
2. Both G and G′ have same number of edges.
3. Both G and G′ have same degree sequences.
The graphs are not isomorphic even if one of the above conditions is not satisfied.
However, these conditions are not sufficient.
10.8 REPRESENTATION OF GRAPHS IN COMPUTER MEMORY
Although graphs are geometric figures, they can be represented by matrix and hence can be
stored in computer memory. The following representations are commonly used:
1. Adjacency matrix (vertex–vertex adjacency ...