Pages that link to "Item:Q1414148"

The following pages link to 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):

Displaying 40 items.

• Questions, conjectures, and data about multiplicity lists for trees (Q331158) (← links)
• Unordered multiplicity lists of a class of binary trees (Q389635) (← links)
• Ordered multiplicity lists for eigenvalues of symmetric matrices whose graph is a linear tree (Q400401) (← links)
• The number of distinct eigenvalues for which an index decreases multiplicity (Q730608) (← links)
• The inverse inertia problem for graphs: Cut vertices, trees, and a counterexample (Q836996) (← 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)
• Multiplicity lists for symmetric matrices whose graphs have few missing edges (Q1688915) (← links)
• The number of \(P\)-vertices in a matrix with maximum nullity (Q1747899) (← links)
• The inverse eigenvalue problem of a graph: multiplicities and minors (Q1985452) (← links)
• An interior inverse problem for the diffusion operator (Q2015360) (← links)
• The inverse eigenvalue problem for linear trees (Q2075498) (← links)
• The minimum number of multiplicity 1 eigenvalues among real symmetric matrices whose graph is a nonlinear tree (Q2076168) (← links)
• On the inverse eigenvalue problem for block graphs (Q2238880) (← 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)
• Diagonalizable matrices whose graph is a tree: the minimum number of distinct eigenvalues and the feasibility of eigenvalue assignments (Q2302884) (← links)
• On the inverse eigenvalue problem for a special kind of acyclic matrices. (Q2315469) (← links)
• Computing the degree of a vertex in the skeleton of acyclic Birkhoff polytopes (Q2347355) (← links)
• Generalizations of the strong Arnold property and the minimum number of distinct eigenvalues of a graph (Q2363102) (← links)
• Changes in vertex status and the fundamental decomposition of a tree relative to a multiple (parter) eigenvalue (Q2410248) (← links)
• On multiplicities of eigenvalues of a boundary value problem on a snowflake graph (Q2419009) (← links)
• Further generalization of symmetric multiplicity theory to the geometric case over a field (Q2663701) (← links)
• Null vectors, Schur complements, and Parter vertices (Q2692984) (← links)
• The minimum number of multiplicity 1 eigenvalues among real symmetric matrices whose graph is a linear tree (Q2693714) (← links)
• Diameter minimal trees (Q2787616) (← links)
• Branch duplication for the construction of multiple eigenvalues in an Hermitian matrix whose graph is a tree (Q3518580) (← links)
• On the Laplacian spectra of graphs with pockets (Q3521116) (← links)
• Implicit construction of multiple eigenvalues for trees (Q3633151) (← links)
• Inverse problems for the impulsive Sturm–Liouville operator with jump conditions (Q4990752) (← links)
• On inverse eigenvalue problems for two kinds of special banded matrices (Q5005480) (← links)
• The Number of Interlacing Equalities Resulting from Removal of a Vertex from a Tree (Q5499735) (← links)
• On the eigenvalues of generalized and double generalized stars (Q5693567) (← links)
• On multiplicities of eigenvalues of a spectral problem on a prolate tree (Q5882815) (← links)
• Bordering of symmetric matrices and an application to the minimum number of distinct eigenvalues for the join of graphs (Q6084878) (← links)
• The liberation set in the inverse eigenvalue problem of a graph (Q6168543) (← links)
• Extremal inverse eigenvalue problem for matrices described by a connected unicyclic graph. (Q6584367) (← links)
• Distinct eigenvalues are realizable with generic eigenvectors (Q6608152) (← links)
• Spectral arbitrariness for trees fails spectacularly (Q6615753) (← links)