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 18 items.
- Zero forcing sets and the minimum rank of graphs (Q2477541) (← links)
- On the difference between the maximum multiplicity and path cover number for tree-like graphs (Q2568981) (← links)
- Rational realizations of the minimum rank of a sign pattern matrix (Q2568989) (← links)
- Further generalization of symmetric multiplicity theory to the geometric case over a field (Q2663701) (← links)
- The minimum number of multiplicity 1 eigenvalues among real symmetric matrices whose graph is a linear tree (Q2693714) (← links)
- Trees and acyclic matrices over arbitrary fields (Q2787609) (← links)
- Diameter minimal trees (Q2787616) (← links)
- The change in eigenvalue multiplicity associated with perturbation of a diagonal entry (Q2895696) (← links)
- The graphs for which the maximum multiplicity of an eigenvalue is two (Q3399125) (← links)
- Branch duplication for the construction of multiple eigenvalues in an Hermitian matrix whose graph is a tree (Q3518580) (← links)
- Implicit construction of multiple eigenvalues for trees (Q3633151) (← links)
- Multiplicities: Adding a Vertex to a Graph (Q4554523) (← links)
- Classification of vertices and edges with respect to the geometric multiplicity of an eigenvalue in a matrix, with a given graph, over a field (Q4685507) (← links)
- Parameters Related to Tree‐Width, Zero Forcing, and Maximum Nullity of a Graph (Q4908829) (← links)
- Computational and Theoretical Challenges for Computing the Minimum Rank of a Graph (Q5060771) (← links)
- On the eigenvalues of generalized and double generalized stars (Q5693567) (← links)
- A note on the multiplicities of the eigenvalues of a graph (Q5693569) (← links)
- The minimum number of multiplicity 1 eigenvalues among real symmetric matrices whose graph is a 2-linear tree (Q6160539) (← links)