Maximal P-sets of matrices whose graph is a tree

DOI10.1016/j.laa.2015.08.005zbMath1322.05092OpenAlexW1145968655MaRDI QIDQ745215

Curtis Nelson, Bryan L. Shader

Publication date: 13 October 2015

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

Full work available at URL: https://doi.org/10.1016/j.laa.2015.08.005

zbMATH Keywords

eigenvaluesacyclic matrixP-vertexP-setparter-setparter-vertex

Mathematics Subject Classification ID

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

Related Items (4)

The number of \(P\)-vertices in a matrix with maximum nullity ⋮ The real symmetric matrices of odd order with a P-set of maximum size ⋮ On the continuity of the maximum size of P-sets of acyclic matrices ⋮ All pairs suffice for a P-set

Cites Work

• Acyclic matrices with a small number of distinct eigenvalues
• Spectral multiplicity and splitting results for a class of qualitative matrices
• On Fiedler- and Parter-vertices of acyclic matrices
• On the relative position of multiple eigenvalues in the spectrum of an Hermitian matrix with a given graph
• Changes in vertex status and the fundamental decomposition of a tree relative to a multiple (parter) eigenvalue
• Non-singular acyclic matrices
• Matrix Analysis
• Eigenvectors of acyclic matrices
• The Parter--Wiener Theorem: Refinement and Generalization
• Hermitian Matrices, Eigenvalue Multiplicities, and Eigenvector Components
• On the Eigenvalues and Eigenvectors of a Class of Matrices

This page was built for publication: Maximal P-sets of matrices whose graph is a tree