On algebraic connectivity of directed scale-free networks

DOI10.1016/j.jfranklin.2018.07.038zbMath1398.90030OpenAlexW2891080236MaRDI QIDQ1796754

Takanobu Imae, Kai Cai

Publication date: 17 October 2018

Published in: Journal of the Franklin Institute (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jfranklin.2018.07.038

zbMATH Keywords

algebraic connectivitydirected complex networks

Mathematics Subject Classification ID

Applications of graph theory (05C90) Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (4)

Effects of adding arcs on the consensus convergence rate of leader-follower multi-agent systems ⋮ An Improved Strong Connectivity Discriminant Algorithm for Complex Directed Networks ⋮ Structural controllability and time-to-control of directed scale-free networks with minimum number of driver nodes ⋮ A directed weighted scale-free network model with an adaptive evolution mechanism

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Old and new results on algebraic connectivity of graphs
• Complex scale-free networks with tunable power-law exponent and clustering
• Algebraic connectivity of interdependent networks
• Fast linear iterations for distributed averaging
• Emergence of Scaling in Random Networks
• Spectral Bounds for the Connectivity of Regular Graphs with Given Order
• A critical point for random graphs with a given degree sequence
• Collective dynamics of ‘small-world’ networks
• Algebraic connectivity of directed graphs
• Deterministic scale-free networks

This page was built for publication: On algebraic connectivity of directed scale-free networks