How many simple undirected non-isomorphic graphs are there with 4 vertices?
Did not understand
hi @omkarkhodwe, for this you need to know about isomorphism between graphs
Two graphs are said to be isomorphic if we can transform one graph into another by swapping labels
You can say given graphs are isomorphic if they have:
- Equal number of vertices.
- Equal number of edges.
- Same degree sequence
So in this question you need to find the maximum size of the set of graphs you can make such that any pair between then are not isomorphic
same indegree and outdegree , means structurally same
I think the answer should be 11 , let me confirm if the choices are correct or not I will inform you as soon as i get the confirmation , till then you can read in more detail about isomorphism here:-
https://www.gatevidyalay.com/graph-isomorphism/
Okay thanks, will do that.
I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.
On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.