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

DOI10.1080/03081089908818608MaRDI QIDQ4264405zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

treeeigenvaluemultiplicity

Mathematics Subject Classification ID

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

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

Cites work

• scientific article; zbMATH DE number 428989 (Why is no real title available?)
• Matrix Analysis
• Mechanical vibration trees
• On the Eigenvalues and Eigenvectors of a Class of Matrices
• Spectral multiplicity and splitting results for a class of qualitative matrices

Cited in

(82)

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

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)