Influence of assortativity and degree-preserving rewiring on the spectra of networks (Q614567): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2154177180 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3627479 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Spectra for Complex Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Performance Analysis of Communications Networks and Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Number of walks and degree powers in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A degree sequence problem related to network design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Another look at the degree constrained subgraph problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparsification—a technique for speeding up dynamic graph algorithms / rank
 
Normal rank

Latest revision as of 15:13, 3 July 2024

scientific article
Language Label Description Also known as
English
Influence of assortativity and degree-preserving rewiring on the spectra of networks
scientific article

    Statements

    Influence of assortativity and degree-preserving rewiring on the spectra of networks (English)
    0 references
    0 references
    4 January 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    assortativity
    0 references
    disassortativity
    0 references
    rewiring algorithm
    0 references
    largest eigenvalue
    0 references
    adjacency matrix
    0 references
    algebraic connectivity
    0 references
    0 references