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
Posted Content

Spectral Clustering for Multiple Sparse Networks: I.

TL;DR: The spectral clustering methods are shown to work under sufficiently mild conditions on the number of multiple networks to detect associative community structures, even if all the individual networks are sparse and most of theindividual networks are below community detectability threshold.
Journal ArticleDOI

On combining graph-partitioning with non-parametric clustering for image segmentation

TL;DR: This paper proposes an alternative implementation of the k-way Ncut approach for image segmentation that alleviates a problem associated with the Ncut algorithm: its tendency to partition regions that are nearly uniform with respect to the segmentation parameter.
Posted Content

Do Cascades Recur

TL;DR: This paper performs a large-scale analysis of cascades on Facebook over significantly longer time scales, and finds that a more complex picture emerges, in which many large cascades recur, exhibiting multiple bursts of popularity with periods of quiescence in between.
Journal ArticleDOI

Laplacian eigenvalues of the zero divisor graph of the ring Zn

TL;DR: In this article, the Laplacian eigenvalues of the zero divisor graph Γ ( Z n ) of the ring Z n were studied and it was shown that Γ( Z n t ) is integral for every prime p and positive integer t ≥ 2.
Journal ArticleDOI

Deleterious mutation prediction in the secondary structure of RNAs

TL;DR: A method is introduced for the prediction of deleterious mutations in the secondary structure of RNAs, based on subdivision of the initial structure into smaller substructures and construction of eigenvalue tables, which relies on their success to predict the folding of small RNA structures.
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)