Eigenvalues, multiplicities and graphs
From MaRDI portal
Publication:4603773
DOI10.1017/9781316155158zbMATH Open1433.05002OpenAlexW4301129706MaRDI QIDQ4603773FDOQ4603773
Authors: Charles R. Johnson, Carlos M. Saiago
Publication date: 19 February 2018
Full work available at URL: http://hdl.handle.net/10362/60870
Recommendations
- Eigenvalues, multiplicities and graphs
- Geometric Parter-Wiener, etc. theory
- On the possible multiplicities of the eigenvalues of a Hermitian matrix whose graph is a tree
- The maximum multiplicity of an eigenvalue in a matrix whose graph is a tree
- Multiplicity lists for symmetric matrices whose graphs have few missing edges
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Distance in graphs (05C12)
Cited In (38)
- Title not available (Why is that?)
- On the spectrum of an equitable quotient matrix and its application
- Diagonalizable matrices whose graph is a tree: the minimum number of distinct eigenvalues and the feasibility of eigenvalue assignments
- An explicit upper bound on disparity for trees of a given diameter
- The effect of removing a 2-downer edge or a cut 2-downer edge triangle for an eigenvalue
- 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
- The minimum number of multiplicity 1 eigenvalues among real symmetric matrices whose graph is a 2-linear tree
- Effects of Asymptomatic Infections on the Spatial Spread of Infectious Diseases
- The inverse characteristic polynomial problem for trees
- On the relationship between the multiplicities of the matrix spectrum and the signs of the components of its eigenvectors in a tree-like structure
- Eigenvalue multiplicity in regular graphs
- The inverse eigenvalue problem for linear trees
- Diminimal families of arbitrary diameter
- Eigenvalues and separation in graphs
- Graphs and Hermitian matrices: eigenvalue interlacing
- On graphs with multiple eigenvalues
- The minimum number of multiplicity 1 eigenvalues among real symmetric matrices whose graph is a nonlinear tree
- Further generalization of symmetric multiplicity theory to the geometric case over a field
- Estimation of the maximum multiplicity of an eigenvalue in terms of the vertex degrees of the graph of a matrix
- The minimum number of eigenvalues of multiplicity one in a diagonalizable matrix, over a field, whose graph is a tree
- Unordered multiplicity lists of wide double paths
- Sparks of symmetric matrices and their graphs
- 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 multiplicity of eigenvalues of unicyclic graphs
- The minimum number of multiplicity 1 eigenvalues among real symmetric matrices whose graph is a linear tree
- The proportion of trees that are linear
- Linear combinations of graph eigenvalues
- Null vectors, Schur complements, and Parter vertices
- Optimization schemes on manifolds for structured matrices with fixed eigenvalues
- Numerical construction of structured matrices with given eigenvalues
- The location of classified edges due to the change in the geometric multiplicity of an eigenvalue in a tree
- Eigenvalues, multiplicities and graphs
- Bicliques and eigenvalues
- Uniformly sparse graphs and matrices
- Title not available (Why is that?)
- Classification of edges in a general graph associated with the change in multiplicity of an eigenvalue
- Parter vertices and generalization of the downer branch mechanism in the general setting
This page was built for publication: Eigenvalues, multiplicities and graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4603773)