scispace - formally typeset
Open AccessJournal ArticleDOI

Algebraic connectivity of graphs

Miroslav Fiedler
- 01 Jan 1973 - 
- Vol. 23, Iss: 2, pp 298-305
Reads0
Chats0
About
This article is published in Czechoslovak Mathematical Journal.The article was published on 1973-01-01 and is currently open access. It has received 3888 citations till now. The article focuses on the topics: Algebraic graph theory & Irreducible component.

read more

Content maybe subject to copyright    Report

Citations
More filters
Journal ArticleDOI

Droop-Free Distributed Control for AC Microgrids With Precisely Regulated Voltage Variance and Admissible Voltage Profile Guarantees

TL;DR: A droop-free distributed cooperative control with precisely regulated voltage variance and admissible voltage profile guarantees for AC microgrids is proposed and it is shown that the steady-state solution of the proposed control can be obtained by solving a set of nonlinear equations.
Journal ArticleDOI

Evolution and similarity evaluation of protein structures in contact map space.

TL;DR: This study uses contact map prediction as an intermediate step in fold prediction from sequence, and finds that the feasibility measure is able to differentiate between feasible and infeasible contact maps.
Journal ArticleDOI

A comparative study of network robustness measures

TL;DR: The experimental results show that the robustness measures are more sensitive to the changes in initial networks than to those in optimized networks, and indicate that it is not wise to just apply the optimized networks obtained by optimizing over one certain robustness measure into practical situations.
Book

Inequalities for Graph Eigenvalues

TL;DR: More than 400 inequalities for eigenvalues of the six matrices associated with finite simple graphs have been studied in this paper, including the adjacency matrix, Laplacian matrix, signless matrix, normalized matrix, Seidel matrix, and distance matrix.
Journal ArticleDOI

Distributed estimation of algebraic connectivity of directed networks

TL;DR: The proposed scheme is introduced in discrete time domain to take advantage of the discretized nature of information flow among networked systems and it shows that, with the knowledge of the first left eigenvector associated with trivial eigenvalue of graph Laplacian, distributed estimation of algebraic connectivity becomes possible.
References
More filters
Book ChapterDOI

Congruent Graphs and the Connectivity of Graphs

TL;DR: In this paper, the authors give conditions that two graphs be congruent and some theorems on the connectivity of graphs, and conclude with some applications to dual graphs, which can also be proved by topological methods.
Related Papers (5)