The spread of the spectrum of a graph

90 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.

Minimizing the least eigenvalues of unicyclic graphs with application to spectral spread (2008, background): “…maximum spread of all graphs of order n is attained only by the graph , where K p denotes the complete graph of order p, K cp is the complement of K p , G ∨ H denotes the graph obtained from the disjoint union G ∪ H by adding new edges from each vertex of G to each vertex of H. Conjecture 1.2 [4].”
Beyond graph energy: norms of graphs and matrices (2015, methodology): “6 Structure of the survey The survey covers results of the papers [11], [23], [34], [35], [37], [38], and [39], with proofs of the known results suppressed; however, results appearing here for the first time are proved in full.”