Maximizing the number of vertices of an N-clique cover of the edges of a graph on N vertices

All the work made so far on edge-covering a graph by cliques focus on finding the minimum number of cliques that cover the graph. On this paper, we fix the number of cliques that cover a graph by the same number of vertices that the graph has, and give an upper bound for the sum of the number of vertices of these cliques in the cases where this covering is possible.