Ars Mathematica Contemporanea · 2014 · 33 citations · 7 references
Natural SciencesComputer ScienceMathematicsCombinatoricsComputational GeometryRepresentation TheoryGraph AlgorithmsGraph TheoryComputational Complexity Of Graph AlgorithmsGraph PartitioningSpectral Graph TheorySpectral RadiusSpectral Radius Analysis
Let K n 1 , n 2 , …, n p denote the complete p -partite graph, p > 1 , on n = n 1 + n 2 + ⋯ + n p vertices and let n 1 ≥ n 2 ≥ ⋯ ≥ n p > 0 . We show that for a fixed value of n , both the spectral radius and the energy of complete p -partite graphs are minimal for complete split graph C S ( n , p − 1) and are maximal for Turán graph T ( n , p ) .
7
An introduction to the theory of graph spectra
Choice Reviews Online · 2010 · 787 citations
Spectra of graphs: theory and application
Gordon J. Savage, S. Toida · Journal of the Franklin Institute · 1981 · 755 citations
On an extremal problem in graph theory
Péter L. Erdős · Colloquium Mathematicum · 1964 · 676 citations · Full text
An extremal problem in graph theory
P. Erdös, Leo Moser · Journal of the Australian Mathematical Society · 1970 · 263 citations · Full text
The largest eigenvalue of a graph: A survey
Dragoš Cvetković, Peter Rowlinson · Linear and Multilinear Algebra · 1990 · 224 citations