A lower bound for algebraic connectivity based on the connection-graph-stability method (Q2431183): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Old and new results on algebraic connectivity of graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A faster algorithm for betweenness centrality* / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3877805 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Lower bounds of the Laplacian spectrum of graphs based on diameter / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Eigenvalues, diameter, and mean distance in graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Connection graph stability method for synchronized coupled chaotic systems / rank | |||
Normal rank | |||
Latest revision as of 22:50, 3 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A lower bound for algebraic connectivity based on the connection-graph-stability method |
scientific article |
Statements
A lower bound for algebraic connectivity based on the connection-graph-stability method (English)
0 references
11 April 2011
0 references
algebraic connectivity
0 references
graph Laplacian
0 references
connection-graph-stability score
0 references
