Maximal graphs and graphs with maximal spectral radius

DOI10.1016/S0024-3795(01)00504-3zbMath1002.05048MaRDI QIDQ1602993

Aidan Roy, D. Dale Olesky, Pauline van den Driessche

Publication date: 24 June 2002

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

zbMATH Keywords

degree sequencethreshold graphstepwise adjacency matrices

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Vertex degrees (05C07)

Related Items

The greedy strategy for optimizing the Perron eigenvalue ⋮ Maximizing spectral radii of uniform hypergraphs with few edges ⋮ Connected graphs of fixed order and size with maximal \(A_\alpha \)-index: the one-dominating-vertex case ⋮ Unoriented Laplacian maximizing graphs are degree maximal ⋮ Maximize the \(Q\)-index of graphs with fixed order and size ⋮ Connected graphs with maximal \(Q\)-index: The one-dominating-vertex case ⋮ Graphs with maximal signless Laplacian spectral radius ⋮ On the reduced signless Laplacian spectrum of a degree maximal graph ⋮ The least eigenvalue of graphs with given connectivity ⋮ Spectral simplex method

Cites Work

• On the maximal index of graphs with a prescribed number of edges
• On the maximal index of connected graphs
• Degree maximal graphs are Laplacian integral
• Threshold graphs and related topics
• Laplacian spectra and spanning trees of threshold graphs
• The sharpness of a lower bound on the algebraic connectivity for maximal graphs
• Graphs and degree sequences. II
• Threshold Sequences
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item