The maximum multiplicity of an eigenvalue in a matrix whose graph is a tree
From MaRDI portal
Publication:4264405
DOI10.1080/03081089908818608zbMath0929.15005OpenAlexW1966911582MaRDI QIDQ4264405
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
Trees (05C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)
Related Items (71)
Complementary eigenvalues of graphs ⋮ Subgraph complementation and minimum rank ⋮ The change in multiplicity of an eigenvalue due to adding or removing edges ⋮ The change in eigenvalue multiplicity associated with perturbation of a diagonal entry ⋮ The inverse inertia problem for graphs: Cut vertices, trees, and a counterexample ⋮ Computation of minimal rank and path cover number for certain graphs ⋮ Minimum rank problems ⋮ Maximum nullity of outerplanar graphs and the path cover number ⋮ Computational and Theoretical Challenges for Computing the Minimum Rank of a Graph ⋮ Questions, conjectures, and data about multiplicity lists for trees ⋮ Multiplicities: Adding a Vertex to a Graph ⋮ Minimum rank and maximum eigenvalue multiplicity of symmetric tree sign patterns ⋮ Converse to the Parter--Wiener theorem: the case of non-trees ⋮ The trees for which maximum multiplicity implies the simplicity of other eigenvalues ⋮ On the minimum rank of the join of graphs and decomposable graphs ⋮ On the maximum multiplicity of an eigenvalue in a matrix whose graph contains exactly one cycle ⋮ Further generalization of symmetric multiplicity theory to the geometric case over a field ⋮ Geometric Parter-Wiener, etc. theory ⋮ Changes in vertex status and the fundamental decomposition of a tree relative to a multiple (parter) eigenvalue ⋮ Unordered multiplicity lists of a class of binary trees ⋮ Acyclic matrices with a small number of distinct eigenvalues ⋮ Ordered multiplicity lists for eigenvalues of symmetric matrices whose graph is a linear tree ⋮ Multiplicity lists for symmetric matrices whose graphs have few missing edges ⋮ The implicit construction of multiplicity lists for classes of trees and verification of some conjectures ⋮ Vertex and edge spread of zero forcing number, maximum nullity, and minimum rank of a graph ⋮ The minimum semidefinite rank of the complement of partial \(k\)-trees ⋮ The minimum number of multiplicity 1 eigenvalues among real symmetric matrices whose graph is a 2-linear tree ⋮ The minimum number of multiplicity 1 eigenvalues among real symmetric matrices whose graph is a linear tree ⋮ Branch duplication for the construction of multiple eigenvalues in an Hermitian matrix whose graph is a tree ⋮ The inverse inertia problem for the complements of partial \(k\)-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. ⋮ A Nordhaus-Gaddum conjecture for the minimum number of distinct eigenvalues of a graph ⋮ On the eigenvalues of generalized and double generalized stars ⋮ A note on the multiplicities of the eigenvalues of a graph ⋮ On the multiplicities of eigenvalues of a Hermitian matrix whose graph is a tree ⋮ The structure of matrices with a maximum multiplicity eigenvalue ⋮ The minimum rank of matrices and the equivalence class graph ⋮ On acyclic and unicyclic graphs whose minimum rank equals the diameter ⋮ Parameters Related to Tree‐Width, Zero Forcing, and Maximum Nullity of a Graph ⋮ The number of \(P\)-vertices in a matrix with maximum nullity ⋮ 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 ⋮ Undirected graphs of Hermitian matrices that admit only two distinct eigenvalues ⋮ The maximum corank of graphs with a 2-separation ⋮ Zero forcing sets and the minimum rank of graphs ⋮ Eigenvalue assignments and the two largest multiplicities in a Hermitian matrix whose graph is a tree ⋮ Patterns with several multiple eigenvalues ⋮ The maximum multiplicity and the two largest multiplicities of eigenvalues in a Hermitian matrix whose graph is a tree ⋮ Complexity and computation of connected zero forcing ⋮ Zero forcing parameters and minimum rank problems ⋮ Signed graphs with stable maximum nullity at most two ⋮ Trees and acyclic matrices over arbitrary fields ⋮ Diameter minimal trees ⋮ Classification of vertices and edges with respect to the geometric multiplicity of an eigenvalue in a matrix, with a given graph, over a field ⋮ Critical ideals, minimum rank and zero forcing number ⋮ Minimum rank and path cover number for generalized and double generalized cycle star 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 minimum number of eigenvalues of multiplicity one in a diagonalizable matrix, over a field, whose graph is a tree ⋮ Smith normal form and acyclic matrices ⋮ Diagonalizable matrices whose graph is a tree: the minimum number of distinct eigenvalues and the feasibility of eigenvalue assignments ⋮ Implicit construction of multiple eigenvalues for trees ⋮ The graphs for which the maximum multiplicity of an eigenvalue is two ⋮ The maximum multiplicity of the largest \(k\)-th eigenvalue in a matrix whose graph is acyclic or unicyclic ⋮ The minimum number of multiplicity 1 eigenvalues among real symmetric matrices whose graph is a nonlinear tree ⋮ On the relationship between the zero forcing number and path cover number for some graphs ⋮ The number of P-vertices for acyclic matrices of maximum nullity ⋮ On the difference between the maximum multiplicity and path cover number for tree-like graphs ⋮ Rational realizations of the minimum rank of a sign pattern matrix ⋮ 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 ⋮ On the relative position of multiple eigenvalues in the spectrum of an Hermitian matrix with a given graph
Cites Work
This page was built for publication: The maximum multiplicity of an eigenvalue in a matrix whose graph is a tree
