Algebraic connectivity of graphs
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
Citations
More filters
Dissertation
Conic optimization of electric power systems
TL;DR: A new type of NP-hard graph cut arising from undirected multicommodity flow networks is formulated, and an eigenvalue bound in the form of the Cheeger inequality is proven, which serves as a starting point for deriving semidefinite relaxations.
Journal ArticleDOI
An autonomy-oriented computing approach to community mining in distributed and dynamic networks
Bo Yang,Jiming Liu,Dayou Liu +2 more
TL;DR: The notion of self-organizing agent networks is introduced, and an autonomy-oriented computing (AOC) approach to distributed and incremental mining of network communities is provided, which utilizes reactive agents that can collectively detect and update community structures in a distributed and dynamically evolving network.
Journal ArticleDOI
Robust consensus control for a class of multi-agent systems via distributed PID algorithm and weighted edge dynamics
Chong-Xiao Shi,Guang-Hong Yang +1 more
TL;DR: By combining Lyapunov theory and Barbalat’s Lemma, it is proved that both the stabilization of weighted edge dynamics and the consensus of MAS can be guaranteed even in the presence of external disturbances.
Dissertation
Design and Optimization of Free Space Optical Networks
TL;DR: This dissertation proposes to design and optimize broadband wireless networks based on the FSO technology, and investigates the problem of building robust spanning trees for FSO networks, and adopts the notion of the algebraic connectivity from spectral graph theory as a measure of network robustness.
Journal ArticleDOI
Affine Combination of Diffusion Strategies Over Networks
TL;DR: This work proposes a combination framework that aggregates the operation of multiple diffusion strategies for enhanced performance by assigning a combination coefficient to each node, and using an adaptation mechanism to minimize the network error.
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.