Majorisations for the eigenvectors of graph-adjacency matrices
From MaRDI portal
Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph algorithms (graph-theoretic aspects) (05C85) Eigenvalues, singular values, and eigenvectors (15A18) Inequalities involving eigenvalues and eigenvectors (15A42)
Recommendations
Cites work
- A new focus in the science of networks: towards methods for design
- A note on the resolvent of a nonnegative matrix and its applications
- Fast linear iterations for distributed averaging
- scientific article; zbMATH DE number 45862 (Why is no real title available?)
- scientific article; zbMATH DE number 47363 (Why is no real title available?)
- scientific article; zbMATH DE number 964896 (Why is no real title available?)
- Laplacian graph eigenvectors
- Scaling: a canonical design problem for networks
- The impact of multi-group multi-layer network structure on the performance of distributed consensus building strategies
Cited in
(1)
This page was built for publication: Majorisations for the eigenvectors of graph-adjacency matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2938636)