The Parter--Wiener Theorem: Refinement and Generalization
From MaRDI portal
Recommendations
Cited in
(95)- Smith normal form and acyclic matrices
- 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.
- The change in multiplicity of an eigenvalue due to adding or removing edges
- Inverse eigenvalue problems for acyclic matrices whose graph is a dense centipede
- Geometric Parter-Wiener, etc. theory
- Multiplicity lists for symmetric matrices whose graphs have few missing edges
- 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
- The implicit construction of multiplicity lists for classes of trees and verification of some conjectures
- A matricial proof of the symmetric exchange axiom for eigenvalues of principal submatrices of a complex Hermitian matrix
- A zero forcing technique for bounding sums of eigenvalue multiplicities
- The inverse eigenvalue problem of a graph: multiplicities and minors
- The change in multiplicity of an eigenvalue of a real symmetric matrix resulting from the changes in edge values around a classified vertex in a tree
- The inverse eigenvalue problem for linear trees
- The minimum number of multiplicity 1 eigenvalues among real symmetric matrices whose graph is a nonlinear tree
- The multiplicity of eigenvalues of trees
- Graphs with eigenvalue \(-1\) of multiplicity \(2 \theta (G)+ \rho (G) -1\)
- Change in vertex status after removal of another vertex in the general setting
- The effect of perturbation of an off-diagonal entry pair on the geometric multiplicity of an eigenvalue
- Undirected graphs of Hermitian matrices that admit only two distinct eigenvalues
- Patterns with several multiple eigenvalues
- The maximum multiplicity and the two largest multiplicities of eigenvalues in a Hermitian matrix whose graph is a tree
- The number of P-vertices of singular acyclic matrices: an inverse problem
- The location of classified edges due to the change in the geometric multiplicity of an eigenvalue in a tree
- 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 acyclic matrices with a P-set of maximum size
- Further generalization of symmetric multiplicity theory to the geometric case over a field
- A relation between multiplicity of nonzero eigenvalues of trees and their matching numbers
- Null vectors, Schur complements, and Parter vertices
- The minimum number of multiplicity 1 eigenvalues among real symmetric matrices whose graph is a linear tree
- Inverse eigenvalue problems for two special acyclic matrices
- Trees and acyclic matrices over arbitrary fields
- Diameter minimal trees
- The real symmetric matrices of odd order with a P-set of maximum size.
- The change in eigenvalue multiplicity associated with perturbation of a diagonal entry
- Normal matrices subordinate to a tree and flat portions of the field of values
- 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
- Leaders in multi-agent controllability under consensus algorithm and tree topology
- Non-singular acyclic matrices
- Implicit construction of multiple eigenvalues for trees
- 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
- Multiplicities: adding a vertex to a graph
- Inverse eigenvalue problems with partial eigen data for acyclic matrices whose graph is a broom
- Hermitian Matrices, Eigenvalue Multiplicities, and Eigenvector Components
- Classification of vertices and edges with respect to the geometric multiplicity of an eigenvalue in a matrix, with a given graph, over a field
- 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
- The multiplicity of eigenvalues of unicyclic graphs
- The number of P-vertices for acyclic matrices with given nullity
- The characterization of the minimal weighted acyclic graphs
- Extremal realization spectra by two acyclic matrices whose graphs are caterpillars
- The change in multiplicity of an eigenvalue of a Hermitian matrix associated with the removal of an edge from its graph
- The minimum number of multiplicity 1 eigenvalues among real symmetric matrices whose graph is a 2-linear tree
- On the number of P-vertices of some graphs
- Line graphs of trees with the largest eigenvalue multiplicity
- Diminimal families of arbitrary diameter
- A characterization of trees with eigenvalue multiplicity one less than their number of pendant vertices
- Eigenvalue multiplicity of graphs with given cyclomatic number and given number of quasi-pendant vertices
- A characterization for a graph with an eigenvalue of multiplicity \(2c(G)+p(G) - 1\)
- Parter vertices and generalization of the downer branch mechanism in the general setting
- The inverse nullity pair problem and the strong nullity interlacing property
- Characterization of graphs with eigenvalue multiplicity one less than the number of external vertices
- Trees with one as Laplacian eigenvalue with multiplicity two less than the number of pendant vertices
- 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
- Multiplicity lists by diameter: all trees of diameter \(< 7\)
- New families of trees determined by their spectra
- The real symmetric matrices with a given rank and a \(\mathrm{P}\)-set with maximum size
- Fundamental graphs for the maximum multiplicity of an eigenvalue among Hermitian matrices with a given graph
- Complete spectral theory for matrices over a field whose graph is a star
- The number of distinct eigenvalues for which an index decreases multiplicity
- 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
- The multiplicity of eigenvalues of \(A_{\alpha}\) of trees
- The maximum multiplicity of an eigenvalue among Hermitian matrices with a given graph, using ``pieceability
- Maximal P-sets of matrices whose graph is a tree
- 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 Fiedler- and Parter-vertices of acyclic matrices
- On the multiplicities of eigenvalues of a Hermitian matrix whose graph is a tree
- The structure of matrices with a maximum multiplicity eigenvalue
- 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: The Parter--Wiener Theorem: Refinement and Generalization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4443829)
