On least eigenvalues and least eigenvectors of real symmetric matrices and graphs (Q1938694): Difference between revisions

@@ Property / cites work @@
+Graphs for which the least eigenvalue is minimal. I
+Normal rank
@@ Property / cites work @@
+A necessary and sufficient eigenvector condition for a connected graph to be bipartite
+Normal rank
@@ Property / cites work @@
+Q3497899
@@ Property / cites work: Q3497899 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3907599
@@ Property / cites work: Q3907599 / rank @@
+Normal rank
@@ Property / cites work @@
+A sharp upper bound on the maximal entry in the principal eigenvector of symmetric nonnegative matrix
+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 @@
+Q3998992
@@ Property / cites work: Q3998992 / rank @@
+Normal rank
@@ Property / cites work @@
+Bounds for the spectral radius of a graph when nodes are removed
+Normal rank
@@ Property / cites work @@
+Q4485695
@@ Property / cites work: Q4485695 / rank @@
+Normal rank
@@ Property / cites work @@
+On maximal entries in the principal eigenvector of graphs
+Normal rank
@@ Property / cites work @@
+On the bounds of maximal entries in the principal eigenvector of symmetric nonnegative matrix
+Normal rank