The asymptotic behaviour of Fiedler's algebraic connectivity for random graphs

DOI10.1016/0012-365X(91)90470-MzbMath0755.05076OpenAlexW2030817973MaRDI QIDQ1182983

Ferenc Juhász

Publication date: 28 June 1992

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(91)90470-m

zbMATH Keywords

random graphalgebraic connectivity

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Connectivity (05C40)

Related Items (9)

Structural Vulnerability and Robustness in Complex Networks: Different Approaches and Relationships Between them ⋮ Old and new results on algebraic connectivity of graphs ⋮ The influence of Miroslav Fiedler on spectral graph theory ⋮ Perturbation of coupling matrices and its effect on the synchronizability in arrays of coupled chaotic systems ⋮ Synchronizability of networks of chaotic systems coupled via a graph with a prescribed degree sequence ⋮ A survey of automated conjectures in spectral graph theory ⋮ Algebraic connectivity of directed graphs ⋮ Collective dynamics of opposing groups with stochastic communication ⋮ Laplacian matrices of graphs: A survey

Cites Work

• The asymptotic behaviour of Lovasz' \(\vartheta\) function for random graphs
• Characteristic vectors of bordered matrices with infinite dimensions
• The eigenvalues of random symmetric matrices
• On the asymptotic distribution of the eigenvalues of random matrices
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The asymptotic behaviour of Fiedler's algebraic connectivity for random graphs