The least eigenvalue of the complements of trees (Q551342): Difference between revisions

@@ Property / author @@
-Yi Wang
@@ Property / author: Yi Wang / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.laa.2011.04.011
+Normal rank
@@ Property / OpenAlex ID @@
+W1970320987
@@ Property / OpenAlex ID: W1970320987 / 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 @@
+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 @@
+Graphs with least eigenvalue \(-2\): The star complement technique
+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 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