Graph theoretic aspects of maximizing the spectral radius of nonnegative matrices

DOI10.1016/0024-3795(95)00691-5zbMath0870.15011OpenAlexW2126878032MaRDI QIDQ677122

Shaun M. Fallat, Pauline van den Driessche, D. Dale Olesky

Publication date: 31 March 1997

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

Full work available at URL: http://hdl.handle.net/1828/2751

zbMATH Keywords

treeorbitsdigraphspectral radiusbipartite graphsdirected cycleirreducible nonnegative matrix

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Inequalities involving eigenvalues and eigenvectors (15A42)

Related Items (1)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Parallel concepts in graph theory
• Maximizing the spectral radius of fixed trace diagonal perturbations of nonnegative matrices
• On the effect of the perturbation of a nonnegative matrix on its Perron eigenvector
• The largest eigenvalue of a graph: A survey

This page was built for publication: Graph theoretic aspects of maximizing the spectral radius of nonnegative matrices