In graph theory for every graph, there is a unique Adjacency
matrix corresponding to that graph. Using the property of this Adjacency
matrix, we can say various properties of the graph. The eigenvalue of a
graph is nothing but the eigenvalue of its Adjacency matrix. In this talk,
we will discuss some upper and lower bounds of the largest eigenvalue of a
graph.
The talk will be elementary.
