A graph with n vertices is called the complete graph if there is edge between every pair of vertices. We can define the eigenvalues of a graph to be eigenvalues of the adjacency matrix of the graph. For all positive integers n, determine the eigenvalues of the complete graph with n vertices.. Convince me that your answers are correct.