3 votes 3 votes if G and G* are isomorphic graphs , then no of connected components of G* if G has connected components, are monali asked Nov 2, 2015 monali 2.1k views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply Pranay Datta 1 commented Nov 3, 2015 reply Follow Share G and G* are isomorphic graphs then no. of connected component will be same as G. 1 votes 1 votes monali commented Nov 4, 2015 reply Follow Share thank you 0 votes 0 votes Please log in or register to add a comment.
3 votes 3 votes Vertex are also known as "nodes" Edges are also known as "links" For two graphs to be isomorphic (same) they must have the following properties: The same number of vertices The same number of edges The same degrees for corresponding vertices The same number of connected components The same number of loops. The same number of parallel edges. Both graphs are connected or both graphs are not connected, Pairs of connected vertices must have the corresponding pair of vertices connected. Example of Isomorphic graphs: ibia answered Feb 10, 2016 ibia comment Share Follow See all 0 reply Please log in or register to add a comment.
