The least eigenvalue of graphs whose complements are unicyclic (Q2344012): Difference between revisions

@@ Property / arXiv ID @@
+.4317
@@ Property / arXiv ID: 1305.4317 / rank @@
+Normal rank
@@ 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 @@
+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 @@
+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 @@
+The least eigenvalue of the complements of trees
@@ Property / cites work: The least eigenvalue of the complements of trees / rank @@
+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 @@
+Further results on the least eigenvalue of connected graphs
+Normal rank
@@ Property / cites work @@
+The vertex (edge) independence number, vertex (edge) cover number and the least eigenvalue of a graph
+Normal rank
@@ Property / cites work @@
+Q3169871
@@ Property / cites work: Q3169871 / rank @@
+Normal rank
@@ Property / cites work @@
+The least eigenvalue of a graph with cut vertices
@@ Property / cites work: The least eigenvalue of a graph with cut vertices / rank @@
+Normal rank
@@ Property / cites work @@
+The least eigenvalue of graphs with given connectivity
+Normal rank