Abstract: We give upper and lower bounds on the spectral radius of a graph in terms of the number of walks. We generalize a number of known results.
Recommendations
Cites work
- scientific article; zbMATH DE number 3425628 (Why is no real title available?)
- scientific article; zbMATH DE number 3717357 (Why is no real title available?)
- scientific article; zbMATH DE number 1179517 (Why is no real title available?)
- A Note on Almost Regular Graphs
- A note on almost regular matrices
- Lower bounds for the clique and the chromatic numbers of a graph
- Maxima for Graphs and a New Proof of a Theorem of Turán
- On the spectral radius and the genus of graphs
- On the spectral radius of graphs
- On the spectral radius of graphs with cut vertices
- Sharp upper and lower bounds for largest eigenvalue of the Laplacian matrices of trees
- Some Inequalities for the Largest Eigenvalue of a Graph
- Some eigenvalue properties in graphs (conjectures of Graffiti -- II)
- Some new bounds on the spectral radius of graphs
- Spectral Radius and Degree Sequence
- Spectral bounds for the clique and independence numbers of graphs
- Spektren endlicher Grafen
Cited in
(49)- Adjacency eigenvalues of graphs without short odd cycles
- scientific article; zbMATH DE number 2104724 (Why is no real title available?)
- A lower bound for the spectral radius of graphs with fixed diameter
- Green walks in a hypergraph
- Bounds on the spectral radii of digraphs in terms of walks
- Eigenvalues and triangles in graphs
- The spectral radii of a graph and its line graph
- Cliques and the spectral radius
- The number of walks in a graph
- A spectral Erdős-Rademacher theorem
- A Brualdi-Hoffman-Turán problem on cycles
- Upper bounds on the spectral radius of book-free and/or \(K_{2,l}\)-free graphs
- Bounds on the spectral radius of digraphs from subgraph counts
- Some new aspects of main eigenvalues of graphs
- Turán's theorem implies Stanley's bound
- Eigenvalues of subgraphs of the cube
- On graphs with exactly three \(Q\)-main eigenvalues
- On the first two eigenvalues of regular graphs
- Signless Laplacian spectral radius of graphs without short cycles or long cycles
- On the spectral radius of graphs without a gem
- A path forward: tropicalization in extremal combinatorics
- Bounds on the (Laplacian) spectral radius of graphs
- scientific article; zbMATH DE number 6269059 (Why is no real title available?)
- New spectral bounds on the chromatic number encompassing all eigenvalues of the adjacency matrix
- Support of closed walks and second eigenvalue multiplicity of graphs
- Sharp upper bounds on the \(Q\)-index of (minimally) 2-connected graphs with given size
- A few examples and counterexamples in spectral graph theory
- Measure-theoretic bounds on the spectral radius of graphs from walks
- Matrix power inequalities and the number of walks in graphs
- Spectral extrema of graphs with fixed size: cycles and complete bipartite graphs
- Extensions on spectral extrema of \(C_5/C_6\)-free graphs with given size
- A spectral version of Mantel's theorem
- On the main spectrum of generalized Bethe trees
- A note on graphs with exactly two main eigenvalues
- New upper bounds on the spectral radius of graphs
- Unified approach to the generalized Turán problem and supersaturation
- Spectral extremal graphs for the bowtie
- The maximum spectral radius of graphs of given size with forbidden subgraph
- The main eigenvalues of the undirected power graph of a group
- Some bounds for total communicability of graphs
- Beyond graph energy: norms of graphs and matrices
- Trees with small spectral gap
- A relationship between the walks and the semi-edge walks of graphs
- Signed spectral Turań-type theorems
- Inequalities for the number of walks in graphs
- Counting substructures and eigenvalues. I: Triangles
- On the spectral radius of minimally 2-(edge)-connected graphs with given size
- Walks and eigenvalues of signed graphs
- Remarks on the largest eigenvalue of a signed graph
This page was built for publication: Walks and the spectral radius of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q852649)
