A divide-and-conquer bound for aggregate's quality and algebraic connectivity (Q2012519)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A divide-and-conquer bound for aggregate's quality and algebraic connectivity |
scientific article; zbMATH DE number 6755331
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A divide-and-conquer bound for aggregate's quality and algebraic connectivity |
scientific article; zbMATH DE number 6755331 |
Statements
A divide-and-conquer bound for aggregate's quality and algebraic connectivity (English)
0 references
1 August 2017
0 references
graph Laplacian eigenvalues
0 references
aggregate's quality
0 references
algebraic connectivity
0 references
divide-and-conquer bounds
0 references
