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
Journal ArticleDOI
Topology for Distributed Inference on Graphs
TL;DR: It is shown that, under appropriate conditions, the topology given by the nonbipartite Ramanujan graphs optimizes the convergence rate of this distributed algorithm.
Posted Content
A nearly-mlogn time solver for SDD linear systems
TL;DR: In this article, the authors presented an improved algorithm for solving symmetric diagonally dominant linear systems, which uses a standard way a 'preconditioning' chain of progressively sparser graphs.
A Study of Synchronization and Group Cooperation Using Partial Contraction Theory
Jean-Jacques E. Slotine,Wei Wang +1 more
Proceedings ArticleDOI
Robust computation of aggregates in wireless sensor networks: distributed randomized algorithms and analysis
TL;DR: This paper presents and analyze a suite of randomized distributed algorithms to efficiently and robustly compute aggregates and uses the eigen-structure of the underlying graph in a novel way to show convergence and to bound the running time of the algorithms.
Journal ArticleDOI
Distributed Coordination of Multi-Agent Systems With Quantized-Observer Based Encoding-Decoding
TL;DR: This paper considers distributed coordination of discrete-time second-order multi-agent systems with partially measurable state and a limited communication data rate, and a quantized-observer based encoding-decoding scheme is designed, which integrates the state observation with encoding/decoding.
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.