I am a bit lost with this question.
There is a graph with 45 vertices. If two vertices have the same degree, they are not connected by an edge. What is the maximal possible number of edges in such a graph?
As far as I understand, if there are any 2 vertices with the same degree, they are not connected with the edge. But how do we calculate the exact number of edges?
Thanks!