The maximum multiplicity of the largest k-th eigenvalue in a matrix whose graph is acyclic or unicyclic.
Mohammad AdmShaun M. FallatPublished in: Discret. Math. (2019)
Keyphrases
- covariance matrix
- perturbation theory
- laplacian matrix
- adjacency matrix
- graph representation
- graph matching
- eigenvalues and eigenvectors
- connected graphs
- np hard
- graph model
- low rank and sparse
- transition matrix
- graph laplacian
- connected components
- structured data
- random walk
- graph structure
- positive definite
- eigenvalue problems
- pseudo inverse
- graph properties
- graph kernels
- distance matrix
- graph theory
- bounded treewidth
- graphical representation
- weighted graph
- singular value decomposition
- markov chain
- principal component analysis