Majorisations for the eigenvectors of graph-adjacency matrices (Q2938636): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3996218 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5691133 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Laplacian graph eigenvectors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scaling: a canonical design problem for networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the resolvent of a nonnegative matrix and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3998482 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The impact of multi-group multi-layer network structure on the performance of distributed consensus building strategies / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new focus in the science of networks: towards methods for design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast linear iterations for distributed averaging / rank
 
Normal rank

Latest revision as of 13:09, 9 July 2024

scientific article
Language Label Description Also known as
English
Majorisations for the eigenvectors of graph-adjacency matrices
scientific article

    Statements

    Majorisations for the eigenvectors of graph-adjacency matrices (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    14 January 2015
    0 references
    algebraic graph theory
    0 references
    network design
    0 references
    dynamical networks
    0 references
    adjacency matrix
    0 references
    eigenvectors
    0 references
    majorisation
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references