Optimizing quadratic forms of adjacency matrices of trees and related eigenvalue problems

DOI10.1016/S0024-3795(00)00305-0zbMath0981.15020OpenAlexW2030421585MaRDI QIDQ5932197

Wai-Shun Cheung, Pauline van den Driessche, D. Dale Olesky, Chi-Kwong Li

Publication date: 21 March 2002

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

Full work available at URL: https://doi.org/10.1016/s0024-3795(00)00305-0

zbMATH Keywords

quadratic formadjacency matrixdiagonal perturbationgraph labellinglargest eigenvaluesmallest eigenvaluetrees

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Quadratic and bilinear forms, inner products (15A63)

Related Items (1)

Numerical ranges of cyclic shift matrices

Uses Software

• symrcm

Cites Work

• Graph theoretic aspects of maximizing the spectral radius of nonnegative matrices
• Some eigenvalue inequalities for a class of Jacobi matrices
• Maximizing the spectral radius of fixed trace diagonal perturbations of nonnegative matrices
• Bounds for the principal frequency of nonuniformly loaded strings
• Matrix Analysis
• Unnamed Item
• Unnamed Item

This page was built for publication: Optimizing quadratic forms of adjacency matrices of trees and related eigenvalue problems