The maximum multiplicity of an eigenvalue in a matrix whose graph is a tree

DOI10.1080/03081089908818608zbMATH Open0929.15005OpenAlexW1966911582MaRDI QIDQ4264405FDOQ4264405

Authors: Charles R. Johnson, António Leal Duarte 

Publication date: 25 January 2000

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

Full work available at URL: https://doi.org/10.1080/03081089908818608

Recommendations

• The maximum multiplicity and the two largest multiplicities of eigenvalues in a Hermitian matrix whose graph is a tree
• Estimation of the maximum multiplicity of an eigenvalue in terms of the vertex degrees of the graph of a matrix
• On the maximum multiplicity of an eigenvalue in a matrix whose graph contains exactly one cycle
• The trees for which maximum multiplicity implies the simplicity of other eigenvalues

zbMATH Keywords

treeeigenvaluemultiplicity

Mathematics Subject Classification ID

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

Cites Work

• Matrix Analysis
• Title not available (Why is that?)
• On the Eigenvalues and Eigenvectors of a Class of Matrices
• Spectral multiplicity and splitting results for a class of qualitative matrices
• Mechanical vibration trees

Cited In (82)

• On the eigenvalues of generalized and double generalized stars
• The graphs for which the maximum multiplicity of an eigenvalue is two
• On acyclic and unicyclic graphs whose minimum rank equals the diameter
• Smith normal form and acyclic matrices
• On the multiplicities of eigenvalues of a Hermitian matrix whose graph is a tree
• Diameter minimal trees
• Acyclic matrices with a small number of distinct eigenvalues
• On multiple eigenvalues of trees
• The structure of matrices with a maximum multiplicity eigenvalue
• The minimum semidefinite rank of the complement of partial \(k\)-trees
• Patterns with several multiple eigenvalues
• The inverse inertia problem for the complements of partial \(k\)-trees
• The trees for which maximum multiplicity implies the simplicity of other eigenvalues
• Branch duplication for the construction of multiple eigenvalues in an Hermitian matrix whose graph is a tree
• Maximum nullity of outerplanar graphs and the path cover number
• The minimum number of multiplicity 1 eigenvalues among real symmetric matrices whose graph is a 2-linear tree
• On the minimum rank of the join of graphs and decomposable graphs
• The number of \(P\)-vertices in a matrix with maximum nullity
• Minimum rank and path cover number for generalized and double generalized cycle star graphs
• On the relative position of multiple eigenvalues in the spectrum of an Hermitian matrix with a given graph
• A note on the multiplicities of the eigenvalues of a graph
• On the maximum multiplicity of an eigenvalue in a matrix whose graph contains exactly one cycle
• The number of distinct eigenvalues for which an index decreases multiplicity
• Vertex and edge spread of zero forcing number, maximum nullity, and minimum rank of a graph
• The maximum multiplicity and the two largest multiplicities of eigenvalues in a Hermitian matrix whose graph is a tree
• The minimum rank of matrices and the equivalence class graph
• The maximum corank of graphs with a 2-separation
• The number of P-vertices for acyclic matrices of maximum nullity
• The change in eigenvalue multiplicity associated with perturbation of a diagonal entry
• Trees and acyclic matrices over arbitrary fields
• The inverse inertia problem for graphs: Cut vertices, trees, and a counterexample
• Minimum rank problems
• Minimum rank and maximum eigenvalue multiplicity of symmetric tree sign patterns
• The minimum number of multiplicity 1 eigenvalues among real symmetric matrices whose graph is a nonlinear tree
• Zero forcing sets and the minimum rank of graphs
• Zero forcing parameters and minimum rank problems
• Subgraph complementation and minimum rank
• Computation of minimal rank and path cover number for certain graphs
• Estimation of the maximum multiplicity of an eigenvalue in terms of the vertex degrees of the graph of a matrix
• Questions, conjectures, and data about multiplicity lists for trees
• The maximum of the minimal multiplicity of eigenvalues of symmetric matrices whose pattern is constrained by a graph
• Unordered multiplicity lists of a class of binary trees
• Ordered multiplicity lists for eigenvalues of symmetric matrices whose graph is a linear tree
• The minimum rank of symmetric matrices described by a graph: a survey
• Multiplicities of eigenvalues and tree-width of graphs
• Complexity and computation of connected zero forcing
• On the difference between the maximum multiplicity and path cover number for tree-like graphs
• The minimum number of multiplicity 1 eigenvalues among real symmetric matrices whose graph is a linear tree
• On the relationship between the zero forcing number and path cover number for some graphs
• Parameters related to tree-width, zero forcing, and maximum nullity of a graph
• Undirected graphs of Hermitian matrices that admit only two distinct eigenvalues
• Eigenvalue assignments and the two largest multiplicities in a Hermitian matrix whose graph is a tree
• Implicit construction of multiple eigenvalues for trees
• Inverse eigenvalue problems and lists of multiplicities of eigenvalues for matrices whose graph is a tree: The case of generalized stars and double generalized stars.
• On the possible multiplicities of the eigenvalues of a Hermitian matrix whose graph is a tree
• Converse to the Parter--Wiener theorem: the case of non-trees
• Changes in vertex status and the fundamental decomposition of a tree relative to a multiple (parter) eigenvalue
• Rational realizations of the minimum rank of a sign pattern matrix
• The implicit construction of multiplicity lists for classes of trees and verification of some conjectures
• The classification of edges and the change in multiplicity of an eigenvalue of a real symmetric matrix resulting from the change in an edge value
• Eigenvalues, multiplicities and graphs
• The multiplicity of eigenvalues of trees
• Diagonalizable matrices whose graph is a tree: the minimum number of distinct eigenvalues and the feasibility of eigenvalue assignments
• Signed graphs with stable maximum nullity at most two
• Exact SDP relaxations of quadratically constrained quadratic programs with forest structures
• Multiplicities: adding a vertex to a graph
• The change in multiplicity of an eigenvalue due to adding or removing edges
• Computational and Theoretical Challenges for Computing the Minimum Rank of a Graph
• On the relationship between the multiplicities of the matrix spectrum and the signs of the components of its eigenvectors in a tree-like structure
• Spectral arbitrariness for trees fails spectacularly
• Further generalization of symmetric multiplicity theory to the geometric case over a field
• The minimum number of eigenvalues of multiplicity one in a diagonalizable matrix, over a field, whose graph is a tree
• Classification of vertices and edges with respect to the geometric multiplicity of an eigenvalue in a matrix, with a given graph, over a field
• Geometric Parter-Wiener, etc. theory
• Optimizing quadratic forms of adjacency matrices of trees and related eigenvalue problems
• Critical ideals, minimum rank and zero forcing number
• Multiplicity lists for symmetric matrices whose graphs have few missing edges
• Null vectors, Schur complements, and Parter vertices
• Uniformly sparse graphs and matrices
• The maximum multiplicity of the largest \(k\)-th eigenvalue in a matrix whose graph is acyclic or unicyclic
• A Nordhaus-Gaddum conjecture for the minimum number of distinct eigenvalues of a graph
• Complementary eigenvalues of graphs

This page was built for publication: The maximum multiplicity of an eigenvalue in a matrix whose graph is a tree

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4264405)