Given a simple graph on 15 vertices consists of several (more than one) isomorphic connected components. What is the maximal possible number of edges in this graph?
I tried by using the bipartite approach and using k complete graph approach but am not able to proceed further. Could you please provide some hints on the approach to be followed for the same?