An Introduction to the Theory of Graph Spectra: Frontmatter

356 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Some properties of the distance Laplacian eigenvalues of a graph (2013, background): “For more details about the adjacency spectrum of a graph see the books [5, 9, 10, 11, 24].”
On the spectrum of hypergraphs (2017, background): “erent properties of the graph structure are explored from these eigenvalues. Adjacency matrix, Laplacian matrix, normalized Laplacian matrix are the popular matrices to study in spectral graph theory [8, 14, 17]. Depending on the graph structure, various bounds on eigenvalues have been estimated. Di”
On the adjacency matrix of a complex unit gain graph (2018, background): “It is well known that [1,5], the (i, j)th entry of the kth power adjacencymatrix of a simple graph provide the number of k-walks (walks of length k) from the vertex i to j.”
On the $A_{\alpha}$-spectra of trees (2016, background): “or their order. The family of these graphs was ﬁrst outlined by J.H. Smith in [12], who showed that any connected graph with spectral radius at most 2 is an induced subgraph of some of them (see also [3], p. 92). This fact is crucial for our proof of Theorem 3. Next, we state a corollary of Proposit”
Random walks and diffusion on networks (2016, neutral): “[44, 51, 54, 93, 137, 139, 140, 224, 225].”