Pages that link to "Item:Q4443829"
From MaRDI portal
The following pages link to The Parter--Wiener Theorem: Refinement and Generalization (Q4443829):
Displayed 29 items.
- Leaders in multi-agent controllability under consensus algorithm and tree topology (Q360669) (← links)
- Unordered multiplicity lists of a class of binary trees (Q389635) (← links)
- Acyclic matrices with a small number of distinct eigenvalues (Q389678) (← links)
- Ordered multiplicity lists for eigenvalues of symmetric matrices whose graph is a linear tree (Q400401) (← links)
- On edge star sets in trees (Q539870) (← links)
- The change in multiplicity of an eigenvalue of a Hermitian matrix associated with the removal of an edge from its graph (Q615995) (← links)
- On the number of P-vertices of some graphs (Q616291) (← links)
- Numerical enclosure for multiple eigenvalues of an Hermitian matrix whose graph is a tree (Q734910) (← links)
- Minimum rank and maximum eigenvalue multiplicity of symmetric tree sign patterns (Q855530) (← links)
- Converse to the Parter--Wiener theorem: the case of non-trees (Q856860) (← links)
- The trees for which maximum multiplicity implies the simplicity of other eigenvalues (Q856861) (← links)
- On Fiedler- and Parter-vertices of acyclic matrices (Q924335) (← links)
- On the multiplicities of eigenvalues of a Hermitian matrix whose graph is a tree (Q931031) (← links)
- The structure of matrices with a maximum multiplicity eigenvalue (Q932157) (← links)
- Eigenvalue assignments and the two largest multiplicities in a Hermitian matrix whose graph is a tree (Q968196) (← links)
- The minimum rank of symmetric matrices described by a graph: a survey (Q996311) (← links)
- Smith normal form and acyclic matrices (Q1016142) (← links)
- 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. (Q1414148) (← links)
- The implicit construction of multiplicity lists for classes of trees and verification of some conjectures (Q1938661) (← links)
- Undirected graphs of Hermitian matrices that admit only two distinct eigenvalues (Q2250939) (← links)
- Patterns with several multiple eigenvalues (Q2259449) (← links)
- The maximum multiplicity and the two largest multiplicities of eigenvalues in a Hermitian matrix whose graph is a tree (Q2259450) (← links)
- Gallai-Edmonds structure theorem for weighted matching polynomial (Q2435543) (← links)
- Sets of Parter vertices which are Parter sets (Q2442429) (← links)
- The acyclic matrices with a P-set of maximum size (Q2512796) (← links)
- The change in eigenvalue multiplicity associated with perturbation of a diagonal entry (Q2895696) (← links)
- Branch duplication for the construction of multiple eigenvalues in an Hermitian matrix whose graph is a tree (Q3518580) (← links)
- Non-singular acyclic matrices (Q3633150) (← links)
- Implicit construction of multiple eigenvalues for trees (Q3633151) (← links)