Pages that link to "Item:Q4264405"
From MaRDI portal
The following pages link to The maximum multiplicity of an eigenvalue in a matrix whose graph is a tree (Q4264405):
Displayed 50 items.
- Questions, conjectures, and data about multiplicity lists for trees (Q331158) (← 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)
- Vertex and edge spread of zero forcing number, maximum nullity, and minimum rank of a graph (Q417526) (← links)
- 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 (Q516666) (← links)
- The minimum semidefinite rank of the complement of partial \(k\)-trees (Q627949) (← links)
- Minimum rank and path cover number for generalized and double generalized cycle star graphs (Q725515) (← links)
- The number of distinct eigenvalues for which an index decreases multiplicity (Q730608) (← links)
- On the relationship between the zero forcing number and path cover number for some graphs (Q779727) (← links)
- The inverse inertia problem for graphs: Cut vertices, trees, and a counterexample (Q836996) (← links)
- Minimum rank problems (Q848577) (← links)
- Maximum nullity of outerplanar graphs and the path cover number (Q848586) (← 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 the minimum rank of the join of graphs and decomposable graphs (Q869896) (← links)
- On the maximum multiplicity of an eigenvalue in a matrix whose graph contains exactly one cycle (Q869912) (← 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)
- On acyclic and unicyclic graphs whose minimum rank equals the diameter (Q947619) (← links)
- Eigenvalue assignments and the two largest multiplicities in a Hermitian matrix whose graph is a tree (Q968196) (← links)
- Zero forcing parameters and minimum rank problems (Q975607) (← 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)
- On the possible multiplicities of the eigenvalues of a Hermitian matrix whose graph is a tree (Q1601616) (← links)
- The change in multiplicity of an eigenvalue due to adding or removing edges (Q1625481) (← links)
- Geometric Parter-Wiener, etc. theory (Q1675672) (← links)
- Multiplicity lists for symmetric matrices whose graphs have few missing edges (Q1688915) (← links)
- A Nordhaus-Gaddum conjecture for the minimum number of distinct eigenvalues of a graph (Q1715848) (← links)
- The number of \(P\)-vertices in a matrix with maximum nullity (Q1747899) (← links)
- The minimum number of eigenvalues of multiplicity one in a diagonalizable matrix, over a field, whose graph is a tree (Q1794310) (← links)
- On the relative position of multiple eigenvalues in the spectrum of an Hermitian matrix with a given graph (Q1870050) (← links)
- Computation of minimal rank and path cover number for certain graphs (Q1887507) (← links)
- The implicit construction of multiplicity lists for classes of trees and verification of some conjectures (Q1938661) (← links)
- Complexity and computation of connected zero forcing (Q2012050) (← links)
- Signed graphs with stable maximum nullity at most two (Q2020682) (← links)
- The minimum number of multiplicity 1 eigenvalues among real symmetric matrices whose graph is a nonlinear tree (Q2076168) (← links)
- Exact SDP relaxations of quadratically constrained quadratic programs with forest structures (Q2114577) (← links)
- Subgraph complementation and minimum rank (Q2121776) (← 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)
- Critical ideals, minimum rank and zero forcing number (Q2279368) (← links)
- Diagonalizable matrices whose graph is a tree: the minimum number of distinct eigenvalues and the feasibility of eigenvalue assignments (Q2302884) (← links)
- The maximum multiplicity of the largest \(k\)-th eigenvalue in a matrix whose graph is acyclic or unicyclic (Q2317668) (← links)
- The number of P-vertices for acyclic matrices of maximum nullity (Q2328110) (← links)
- Complementary eigenvalues of graphs (Q2359565) (← links)
- Changes in vertex status and the fundamental decomposition of a tree relative to a multiple (parter) eigenvalue (Q2410248) (← links)