A lower bound for algebraic connectivity based on the connection-graph-stability method (Q2431183): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2064571435
@@ Property / OpenAlex ID: W2064571435 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q107438156
@@ Property / Wikidata QID: Q107438156 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.2782
@@ Property / arXiv ID: 0909.2782 / rank @@
+Normal rank
@@ Property / cites work @@
+Old and new results on algebraic connectivity of graphs
+Normal rank
@@ Property / cites work @@
+A faster algorithm for betweenness centrality*
@@ Property / cites work: A faster algorithm for betweenness centrality* / rank @@
+Normal rank
@@ Property / cites work @@
+Q3877805
@@ Property / cites work: Q3877805 / rank @@
+Normal rank
@@ Property / cites work @@
+Lower bounds of the Laplacian spectrum of graphs based on diameter
+Normal rank
@@ Property / cites work @@
+Eigenvalues, diameter, and mean distance in graphs
+Normal rank
@@ Property / cites work @@
+Connection graph stability method for synchronized coupled chaotic systems
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2431183