Pages that link to "Item:Q1079582"

The following pages link to Spectral bounds for the clique and independence numbers of graphs (Q1079582):

Displaying 48 items.

• Spectral radius of digraphs with given dichromatic number (Q2431161) (← links)
• Bounds on graph eigenvalues. II (Q2459961) (← links)
• Laplacian spectral bounds for clique and independence numbers of graphs (Q2642010) (← links)
• Cliques and the spectral radius (Q2642018) (← links)
• On the spectral radius of graphs without a star forest (Q2659180) (← links)
• The maximum spectral radius of wheel-free graphs (Q2659251) (← links)
• A sharp upper bound on the spectral radius of \(C_5\)-free/\(C_6\)-free graphs with given size (Q2668072) (← links)
• On a conjecture of Nikiforov involving a spectral radius condition for a graph to contain all trees (Q2675869) (← links)
• Spectral extremal graphs for disjoint cliques (Q2684892) (← links)
• Spectral radius conditions for the existence of all subtrees of diameter at most four (Q2685383) (← links)
• On graphs with eigenvectors in \(\{-1,0,1\}\) and the max \(k\)-cut problem (Q2685391) (← links)
• The maximum spectral radius of graphs of given size with forbidden subgraph (Q2696305) (← links)
• A spectral condition for the existence of cycles with consecutive odd lengths in non-bipartite graphs (Q2699932) (← links)
• Graphs with small independence number minimizing the spectral radius (Q2864859) (← links)
• The largest eigenvalue of a graph: A survey (Q4713877) (← links)
• Eigenvalues and triangles in graphs (Q4993261) (← links)
• Vertex isoperimetry and independent set stability for tensor powers of cliques (Q5002636) (← links)
• Chromatic number and signless Laplacian spectral radius of graphs (Q5104011) (← links)
• New analytical lower bounds on the clique number of a graph (Q5268926) (← links)
• Spectral Proofs of Maximality of Some Seidel Matrices (Q5866461) (← links)
• Some Motzkin-Straus type results for non-uniform hypergraphs (Q5963619) (← links)
• The maximum spectral radius of \(\{C_3, C_5\}\)-free graphs of given size (Q6046169) (← links)
• A strengthening of the spectral chromatic critical edge theorem: Books and theta graphs (Q6046685) (← links)
• On the \(A_\alpha \)-spectral radius of graphs with given size (Q6048445) (← links)
• Spectral extremal graphs for the bowtie (Q6056745) (← links)
• Clique-factors in graphs with sublinear -independence number (Q6064154) (← links)
• A Spectral Erdős-Sós Theorem (Q6072289) (← links)
• Extensions on spectral extrema of \(C_5/C_6\)-free graphs with given size (Q6080541) (← links)
• Refinement on Spectral Turán’s Theorem (Q6081801) (← links)
• (Q6090845) (← links)
• An \(A_\alpha\)-spectral Erdős-Pósa theorem (Q6098083) (← links)
• On \(A_{\alpha}\) spectral extrema of graphs forbidding even cycles (Q6102086) (← links)
• The high order spectrum of a graph and its applications in graph colouring and clique counting (Q6133767) (← links)
• Two conjectured strengthenings of Turán's theorem (Q6141065) (← links)
• On the first two eigenvalues of regular graphs (Q6154412) (← links)
• Remarks on the largest eigenvalue of a signed graph (Q6166492) (← links)
• The index of signed graphs with forbidden subgraphs (Q6166495) (← links)
• The bipartite Turán number and spectral extremum for linear forests (Q6178775) (← links)
• Extremal results for \(C_3^-\)-free signed graphs (Q6184913) (← links)
• Spectral Turán problems for intersecting even cycles (Q6187353) (← links)
• Independence number and spectral radius of cactus graphs (Q6495260) (← links)
• A spectral Erdős-Rademacher theorem (Q6564068) (← links)
• The minimum spectral radius for \(K_{r+1}\)-saturated graphs with \(r = 4\), 5 (Q6570040) (← links)
• Spectral extremal results on trees (Q6574373) (← links)
• Spectral extrema of graphs with fixed size: forbidden triangles and pentagons (Q6589128) (← links)
• On the spectral radius of graphs without a gem (Q6589142) (← links)
• Spectral extremal graphs without intersecting triangles as a minor (Q6614160) (← links)
• The spectral even cycle problem (Q6615499) (← links)