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
Proceedings ArticleDOI
Measuring robustness of complex networks under MVC attack
TL;DR: The results show that P2P and co-authorship networks are extremely robust under the MVC attack while both the online social networks and the Email communication networks exhibit vulnerability under theMVC attack.
Journal ArticleDOI
Mesoscopic structures and the Laplacian spectra of random geometric graphs
TL;DR: The probability of certain mesoscopic structures is analytically calculated for one-dimensional RGGs and they are shown to produce integer-valued eigenvalues that comprise a significant fraction of the spectrum, even in the large network limit.
Proceedings ArticleDOI
Bisection algorithm of increasing algebraic connectivity by adding an edge
TL;DR: A computationally efficient algorithm of finding e such that the second smallest eigenvalue (algebraic connectivity, λ 2 (G′)) of G′ is maximized, which is nearly comparable to that of a simple greedy-type heuristic, O(2mn).
Journal ArticleDOI
The laplacian matrix of a graph: unimodular congruence
TL;DR: In this article, the authors give graph-theoretic conditions that are sufficient for the Laplaceman matrices of two graphs to be congruent by a unimodular matrix.
Laplace-Beltrami Eigenfunctions Towards an Algorithm That "Understands" Geometry.
TL;DR: In this paper, the eigenfunctions of the Laplace-Beltrami operator are used to construct a hierarchical function basis for spherical harmonics, which corresponds to the classical spherical harmonic topology.
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.