Dragoš Cvetković, Peter Rowlinson
Abstract
This article is a survey of results concerning the largest eigenvalue (or index) of a grapn, catcgoiizeu as follows (1) inequalities lor the index, (2) graph with bounded index, (3) ordering graphs by their indices, (4) graph operations and modifications, (5) random graphs, (6) applications.
OpenAlex reports 225 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
This article is a survey of results concerning the largest eigenvalue (or index) of a grapn, catcgoiizeu as follows (1) inequalities lor the index, (2) graph with bounded index, (3) ordering graphs by their indices, (4) graph operations and modifications, (5) random graphs, (6) applications.
Key concepts: Mathematics, Combinatorics, Graph, Bounded function, Eigenvalues and eigenvectors, Index (typography), Discrete mathematics, Algebraic connectivity