On the Eigenvalues and Eigenvectors of a Class of Matrices
From MaRDI portal
Cited in
(92)- Combinatorial matrix analysis: An overview
- Some possible new directions for combinatorial matrix analysis
- Construction of acyclic matrices from spectral data
- A graph theoretic approach to matrix inversion by partitioning
- Combinatorially symmetric matrices
- Eigenvalues of matrices with tree graphs
- Null space structure of tree-patterned matrices
- On the possible multiplicities of the eigenvalues of a Hermitian matrix whose graph is a tree
- The change in multiplicity of an eigenvalue due to adding or removing edges
- Geometric Parter-Wiener, etc. theory
- The number of P-vertices in a matrix with maximum nullity
- The minimum number of eigenvalues of multiplicity one in a diagonalizable matrix, over a field, whose graph is a tree
- Hidden pools, hidden modes, and visible repeated eigenvalues in compartmental models
- On the relative position of multiple eigenvalues in the spectrum of an Hermitian matrix with a given graph
- Computation of minimal rank and path cover number for certain graphs
- The implicit construction of multiplicity lists for classes of trees and verification of some conjectures
- The inverse eigenvalue problem of a graph: multiplicities and minors
- The multiplicity of eigenvalues of trees
- Graphs with eigenvalue \(-1\) of multiplicity \(2 \theta (G)+ \rho (G) -1\)
- The bifurcation lemma for strong properties in the inverse eigenvalue problem of a graph
- The maximum multiplicity and the two largest multiplicities of eigenvalues in a Hermitian matrix whose graph is a tree
- Construction of real skew-symmetric matrices from interlaced spectral data, and graph
- Mechanical vibration trees
- The number of P-vertices of singular acyclic matrices: an inverse problem
- Diagonalizable matrices whose graph is a tree: the minimum number of distinct eigenvalues and the feasibility of eigenvalue assignments
- The maximum multiplicity of the largest \(k\)-th eigenvalue in a matrix whose graph is acyclic or unicyclic
- The number of P-vertices for acyclic matrices of maximum nullity
- Changes in vertex status and the fundamental decomposition of a tree relative to a multiple (parter) eigenvalue
- Gallai-Edmonds structure theorem for weighted matching polynomial
- Sets of Parter vertices which are Parter sets
- The minimum rank of matrices and the equivalence class graph
- Roots of an irreducible continuant
- Minimum-rank matrices with prescribed graph
- A relation between multiplicity of nonzero eigenvalues of trees and their matching numbers
- Null vectors, Schur complements, and Parter vertices
- Trees and acyclic matrices over arbitrary fields
- On the rank spread of graphs
- The change in eigenvalue multiplicity associated with perturbation of a diagonal entry
- Compartmental analysis of dynamic nuclear medicine data: models and identifiability
- Questions, conjectures, and data about multiplicity lists for trees
- The singular acyclic matrices with the second largest number of P-vertices
- Branch duplication for the construction of multiple eigenvalues in an Hermitian matrix whose graph is a tree
- Non-singular acyclic matrices
- Implicit construction of multiple eigenvalues for trees
- The nilpotent-centralizer method for spectrally arbitrary patterns
- Ordered multiplicity lists for eigenvalues of symmetric matrices whose graph is a linear tree
- The maximum multiplicity of an eigenvalue in a matrix whose graph is a tree
- Multiplicities: adding a vertex to a graph
- Classification of vertices and edges with respect to the geometric multiplicity of an eigenvalue in a matrix, with a given graph, over a field
- Nowhere-zero eigenvectors of graphs
- Integral trees with given 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
- On edge star sets in trees
- The number of interlacing equalities resulting from removal of a vertex from a tree
- On the eigenvalues of generalized and double generalized stars
- A note on the multiplicities of the eigenvalues of a graph
- Hidden oscillations in generalized linear mammillary compartmental models
- Some structural results concerning certain classes of qualitative matrices and their inverses
- The number of P-vertices for acyclic matrices with given nullity
- On the number of P-vertices of some graphs
- Diminimal families of arbitrary diameter
- A characterization of trees with eigenvalue multiplicity one less than their number of pendant vertices
- Sparks of symmetric matrices and their graphs
- Reconstruction from one labelled card and more
- Uniformly sparse graphs and matrices
- The inverse nullity pair problem and the strong nullity interlacing property
- Moore-Penrose inverse of an interval matrix and its application
- Inverse eigenvalue problems associated with spring-mass systems
- Multiplicity of graph Hermitian eigenvalues
- The P-vertex problem for symmetric matrices whose associated graphs admit perfect matchings
- Inverse eigenvalue problem for discrete Schrödinger operators of a graph
- The minimum number of distinct eigenvalues of a threshold graph is at most 4
- New families of trees determined by their spectra
- Potential counter-examples to a conjecture on the column space of the adjacency matrix
- The full P-vertex problem for unicyclic graphs
- Fundamental graphs for the maximum multiplicity of an eigenvalue among Hermitian matrices with a given graph
- Inverse Fiedler vector problem of a graph
- Multiplicity of nonzero eigenvalues of a tree in terms of domination number or matching number
- Numerical enclosure for multiple eigenvalues of an Hermitian matrix whose graph is a tree
- Maximal P-sets of matrices whose graph is a tree
- The symmetrization of matrices by diagonal matrices
- Spectral multiplicity and splitting results for a class of qualitative matrices
- Maximum generic nullity of 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 maximum multiplicity of an eigenvalue in a matrix whose graph contains exactly one cycle
- Effects of passive dendritic tree properties on the firing dynamics of a leaky-integrate-and-fire neuron
- On Fiedler- and Parter-vertices of acyclic matrices
- On the multiplicities of eigenvalues of a Hermitian matrix whose graph is a tree
- Eigenvalue assignments and the two largest multiplicities in a Hermitian matrix whose graph is a tree
- The minimum rank of symmetric matrices described by a graph: a survey
This page was built for publication: On the Eigenvalues and Eigenvectors of a Class of Matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5723951)