A combinatorial converse to the Perron-Frobenius theorem

DOI10.1016/0024-3795(90)90026-9zbMath0739.15004OpenAlexW2037030461MaRDI QIDQ1813899

Charles R. Johnson, Carolyn A. Eschenbach

Publication date: 25 June 1992

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

Full work available at URL: https://doi.org/10.1016/0024-3795(90)90026-9

zbMATH Keywords

spectral radiuscyclesPerron-Frobenius theoremPerron propertysign- pattern matrix

Mathematics Subject Classification ID

Eigenvalues, singular values, and eigenvectors (15A18)

Related Items (12)

Sign patterns that require real, nonreal or pure imaginary eigenvalues ⋮ Linear operators strongly preserving matrices whose sign patterns require the Perron property ⋮ Unnamed Item ⋮ On matrices with cyclic structure ⋮ Idempotence for sign-pattern matrices ⋮ The structure of tripotent sign pattern matrices ⋮ From real to complex sign pattern matrices ⋮ On the inertia sets of some symmetric sign patterns ⋮ Allow problems concerning spectral properties of sign pattern matrices: a survey ⋮ Sign-patterns which require a positive eigenvalue ⋮ Relations between Perron-Frobenius results for matrix pencils ⋮ Conditions for the positivity of determinants

Cites Work

• Cyclic and diagonal products on a matrix
• Matrix Analysis
• Diagonal similarity and equivalence for matrices over groups with 0

This page was built for publication: A combinatorial converse to the Perron-Frobenius theorem