1. Graph and Adjacency matrix of its
A graph A graph |
2. Largest eigenvalue of a clique with n vertices is n-1
A clique with vertices is A clique with vertices is |
3.a Here is a graph of order n such that every degree of vertices is k. Where k is even.
Then largest eigenvalue equal to k
|
3.b Here is a graph of order n such that every degree of vertices is k. Where k is odd and n is even.
Then largest eigenvalue equal to k
|
|