Some results on the largest and least eigenvalues of graphs
Some results on the largest and least eigenvalues of graphs
Let G = (V,E) be a simple graph with vertex set V (G) = {v1,v2,...,vn} and edge set E(G). In this paper, first some sharp upper and lower bounds on the largest and least eigenvalues of graphs are given when vertices are removed. Some conjectures in (M. Aouchiche. Comparaison Automatisee …