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
Connectivity-maintaining and collision-avoiding performance function approach for robust leader–follower formation control of multiple uncertain underactuated surface vessels
Bong Seok Park,Sung Jin Yoo +1 more
TL;DR: In this article, a robust leader-follower formation tracking design using connectivity-maintaining and collision-avoiding performance functions is developed for multiple uncertain underactuated surface vessels (USVs).
Journal ArticleDOI
Mutational analysis in RNAs: comparing programs for RNA deleterious mutation prediction
Danny Barash,Alexander Churkin +1 more
TL;DR: This review describes three different freeware programs (RNAMute, RDMAS and RNAmutants) that have been developed for RNA mutational analysis and finds that RNAMute is well fit for large scale simulations involving the calculation of all k-mutants, where k can be a large integer number of a given RNA sequence.
Journal ArticleDOI
Faster quantum walk search on a weighted graph
TL;DR: In this paper, a randomly walking quantum particle evolving by Schr\"odinger's equation searches for a unique marked vertex on the ''simplex of complete graphs'' in time Θ(n σ 3/4 ).
Book
Quantum Computer Systems : Research for Noisy Intermediate-Scale Quantum Computers
Yongshan Ding,Frederic T. Chong +1 more
TL;DR: This book targets computer scientists and engineers who are familiar with concepts in classical computer systems but are curious to learn the general architecture of quantum computing systems.
Posted Content
Generalized Spectral Clustering via Gromov-Wasserstein Learning
Samir Chowdhury,Tom Needham +1 more
TL;DR: This work establishes a bridge between spectral clustering and Gromov-Wasserstein Learning (GWL), a recent optimal transport-based approach to graph partitioning, and shows that when comparing against a two-node template graph using the heat kernel at the infinite time limit, the resulting partition agrees with the partition produced by the Fiedler vector.
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.