We know ,
a) No of vertices in G = No of vertices in G'
b) No of edges in G + No of edges in G' = No of edges in Kn (complete graph of n vertices) = n(n-1)/2
So considering these 2 properties , we have :
n(n-1)/2 = No of edges in G + No of edges in G'
==> n(n-1)/2 = 15 + 13 = 28
==> n = 8 [Only positive solution to be considered as n is no of vertices]
Hence each of G and G' contain 8 vertices..