Pages that link to "Item:Q852649"

The following pages link to Walks and the spectral radius of graphs (Q852649):

Displaying 43 items.

• A note on graphs with exactly two main eigenvalues (Q331176) (← links)
• Inequalities for the number of walks in graphs (Q378237) (← links)
• New spectral bounds on the chromatic number encompassing all eigenvalues of the adjacency matrix (Q396873) (← links)
• Matrix power inequalities and the number of walks in graphs (Q403573) (← links)
• Beyond graph energy: norms of graphs and matrices (Q739093) (← links)
• Upper bounds on the spectral radius of book-free and/or \(K_{2,l}\)-free graphs (Q861014) (← links)
• The spectral radii of a graph and its line graph (Q869917) (← links)
• Bounds on the (Laplacian) spectral radius of graphs (Q875030) (← links)
• A lower bound for the spectral radius of graphs with fixed diameter (Q992783) (← links)
• Eigenvalues of subgraphs of the cube (Q1746572) (← links)
• On the main spectrum of generalized Bethe trees (Q1979383) (← links)
• Measure-theoretic bounds on the spectral radius of graphs from walks (Q2032249) (← links)
• Spectral extrema of graphs with fixed size: cycles and complete bipartite graphs (Q2033928) (← links)
• Unified approach to the generalized Turán problem and supersaturation (Q2065917) (← links)
• Signless Laplacian spectral radius of graphs without short cycles or long cycles (Q2132508) (← links)
• Sharp upper bounds on the \(Q\)-index of (minimally) 2-connected graphs with given size (Q2166257) (← links)
• A path forward: tropicalization in extremal combinatorics (Q2166338) (← links)
• A spectral version of Mantel's theorem (Q2237213) (← links)
• Adjacency eigenvalues of graphs without short odd cycles (Q2237217) (← links)
• Turán's theorem implies Stanley's bound (Q2296007) (← links)
• A few examples and counterexamples in spectral graph theory (Q2296012) (← links)
• Some new aspects of main eigenvalues of graphs (Q2301013) (← links)
• Bounds on the spectral radii of digraphs in terms of walks (Q2344661) (← links)
• Some bounds for total communicability of graphs (Q2418987) (← links)
• Cliques and the spectral radius (Q2642018) (← links)
• Signed spectral Turań-type theorems (Q2685382) (← links)
• The maximum spectral radius of graphs of given size with forbidden subgraph (Q2696305) (← links)
• Counting substructures and eigenvalues. I: Triangles (Q2700994) (← links)
• Trees with small spectral gap (Q3174804) (← links)
• On graphs with exactly three Q-main eigenvalues (Q4956621) (← links)
• Eigenvalues and triangles in graphs (Q4993261) (← links)
• Bounds on the Spectral Radius of Digraphs from Subgraph Counts (Q5112240) (← links)
• The Main Eigenvalues of the Undirected Power Graph of a Group (Q5123459) (← links)
• (Q5163749) (← links)
• On the spectral radius of minimally 2-(edge)-connected graphs with given size (Q6042107) (← links)
• Walks and eigenvalues of signed graphs (Q6048257) (← links)
• Spectral extremal graphs for the bowtie (Q6056745) (← links)
• Extensions on spectral extrema of \(C_5/C_6\)-free graphs with given size (Q6080541) (← links)
• On the first two eigenvalues of regular graphs (Q6154412) (← links)
• Remarks on the largest eigenvalue of a signed graph (Q6166492) (← links)
• A spectral Erdős-Rademacher theorem (Q6564068) (← links)
• A Brualdi-Hoffman-Turán problem on cycles (Q6568842) (← links)
• On the spectral radius of graphs without a gem (Q6589142) (← links)