Extremal Graph Realizations and Graph Laplacian Eigenvalues

DOI10.1137/22m1504421zbMath1519.05159arXiv2206.10010OpenAlexW4385334649MaRDI QIDQ6171259

Braxton Osting

Publication date: 11 August 2023

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2206.10010

zbMATH Keywords

eigenvalue optimizationspectral embeddinggraph Laplaciangraph realization

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Inequalities involving eigenvalues and eigenvectors (15A42)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sharp eigenvalue bounds and minimal surfaces in the ball
• Distance-regular graphs
• Existence and regularity of maximal metrics for the first Laplace eigenvalue on surfaces
• Upper bounds on algebraic connectivity via convex optimization
• Eigenvalue multiplicities of highly symmetric graphs
• Spectrally optimized pointset configurations
• Laplacian eigenvectors of graphs. Perron-Frobenius and Faber-Krahn type theorems
• CVXPY: A Python-Embedded Modeling Language for Convex Optimization
• Eigenvalues of the Laplacian of a graph^∗
• Eigenvectors of Distance-Regular Graphs
• Computation of free boundary minimal surfaces via extremal Steklov eigenvalue problems

This page was built for publication: Extremal Graph Realizations and Graph Laplacian Eigenvalues