The minimum spectral radius of graphs with a given independence number (Q1030756): Difference between revisions

@@ Property / cites work @@
+Linear inequalities among graph invariants: Using <i>GraPHedron</i>  to uncover optimal relationships
+Normal rank
@@ Property / cites work @@
+Q4327350
@@ Property / cites work: Q4327350 / rank @@
+Normal rank
@@ Property / cites work @@
+The minimal spectral radius of graphs with a given diameter
+Normal rank
@@ Property / cites work @@
+A sharp upper bound of the spectral radius of graphs
+Normal rank
@@ Property / cites work @@
+Ordering trees by their largest eigenvalues
@@ Property / cites work: Ordering trees by their largest eigenvalues / rank @@
+Normal rank
@@ Property / cites work @@
+Laplacian spectral bounds for clique and independence numbers of graphs
+Normal rank
@@ Property / cites work @@
+Bounds on graph eigenvalues. II
@@ Property / cites work: Bounds on graph eigenvalues. II / rank @@
+Normal rank
@@ Property / cites work @@
+Q3291034
@@ Property / cites work: Q3291034 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5653952
@@ Property / cites work: Q5653952 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3497917
@@ Property / cites work: Q3497917 / rank @@
+Normal rank
@@ Property / cites work @@
+Spectral bounds for the clique and independence numbers of graphs
+Normal rank
@@ Property / cites work @@
+The spectral radius of trees on \(k\) pendant vertices
+Normal rank