The least eigenvalue of a graph with cut vertices (Q972775): Difference between revisions

@@ Property / cites work @@
+Graphs for which the least eigenvalue is minimal. I
+Normal rank
@@ Property / cites work @@
+Graphs for which the least eigenvalue is minimal. II.
+Normal rank
@@ Property / cites work @@
+On the spectral radius of graphs with cut vertices
+Normal rank
@@ Property / cites work @@
+On the spectral radius of (0,1)-matrices
@@ Property / cites work: On the spectral radius of (0,1)-matrices / rank @@
+Normal rank
@@ Property / cites work @@
+The largest eigenvalue of a graph: A survey
@@ Property / cites work: The largest eigenvalue of a graph: A survey / rank @@
+Normal rank
@@ Property / cites work @@
+Q4327350
@@ Property / cites work: Q4327350 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4828550
@@ Property / cites work: Q4828550 / rank @@
+Normal rank
@@ Property / cites work @@
+Minimizing the least eigenvalues of unicyclic graphs with application to spectral spread
+Normal rank
@@ Property / cites work @@
+Sharp lower bounds of the least eigenvalue of planar graphs
+Normal rank
@@ Property / cites work @@
+The least eigenvalue of unicyclic graphs with \(n\) vertices and \(k\) pendant vertices
+Normal rank
@@ Property / cites work @@
+Bicyclic graphs for which the least eigenvalue is minimum
+Normal rank
@@ Property / cites work @@
+The least eigenvalue of graphs with given connectivity
+Normal rank