reopened by
1,807 views
0 votes
0 votes
If there are two graphs G1 and G2 and both are Isomorphic to each other...Is G1 subset of G2?
reopened by

2 Answers

3 votes
3 votes
ISOMORPHISM:

For isomorphism of any two graph ,it is necessary that the matrix representation of both of the graphs should be same . it means that  when we erase the label of graph then both  graph should be equal.

few theorems are there which says about  isomorphism :

1. no of vertices of G1 and G2 should be same.

2.no of edges of G1 and G2 should be same.

3.degree sequence of G1 and G2 should be same .

4.no of cycles of one length in G1 and G2 should be same .

5.degree of neighboring vertex  corresponding any other vertex in both of the graph should be same.

Above all theorems are sufficient to prove G1 and G2 are isomorphic to each other.

NOW ,  the question is about subset .subset  incudes equal also . so when G1 and G2 are isomorpjhic to each other then   we can say that G1 is also subset of G2. but it cant be the proper subset of G2.

proper subset is strict about atleast 1 less.

hope it will help you .

:)
0 votes
0 votes
G1 will be equal to G2..
edited by

Related questions

2 votes
2 votes
2 answers
1
srestha asked Jan 9, 2018
1,281 views
Number of subgraphs possible for K3 =____________
0 votes
0 votes
1 answer
2
Çșȇ ʛấẗẻ asked Aug 28, 2023
180 views
1 votes
1 votes
0 answers
3
Chhotu asked Nov 10, 2017
230 views
Hi Guys,There is no algorithm to find graph isomorphism (as mentioned by @Rupendra Choudhary) then how much time does Brute force algorithm will takes (means one answer c...
0 votes
0 votes
1 answer
4
Saurav asked Aug 27, 2015
1,397 views
The predessor subgraph of BFS is a tree but the predecessor subgraph of DFS is a forest ?? please explain why??