Walks and the spectral radius of graphs

DOI10.1016/J.LAA.2006.02.003zbMATH Open1106.05065arXivmath/0506259OpenAlexW2046226064MaRDI QIDQ852649FDOQ852649

Authors: Vladimir Nikiforov 

Publication date: 15 November 2006

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/math/0506259

Recommendations

• Bounds on the spectral radii of digraphs in terms of walks
• Measure-theoretic bounds on the spectral radius of graphs from walks
• The number of walks in a graph
• New upper bounds on the spectral radius of graphs
• A relationship between the walks and the semi-edge walks of graphs

zbMATH Keywords

clique numbernumber of walkssemiregular graphpseudo-regular graph

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Cites Work

• Title not available (Why is that?)
• Some Inequalities for the Largest Eigenvalue of a Graph
• Title not available (Why is that?)
• On the spectral radius of graphs
• Some new bounds on the spectral radius of graphs
• On the spectral radius of graphs with cut vertices
• Maxima for Graphs and a New Proof of a Theorem of Turán
• Spektren endlicher Grafen
• Sharp upper and lower bounds for largest eigenvalue of the Laplacian matrices of trees
• Some eigenvalue properties in graphs (conjectures of Graffiti -- II)
• Lower bounds for the clique and the chromatic numbers of a graph
• Spectral bounds for the clique and independence numbers of graphs
• Spectral Radius and Degree Sequence
• A Note on Almost Regular Graphs
• Title not available (Why is that?)
• On the spectral radius and the genus of graphs
• A note on almost regular matrices

Cited In (49)

• Adjacency eigenvalues of graphs without short odd cycles
• Eigenvalues and triangles in graphs
• Green walks in a hypergraph
• Bounds on the spectral radii of digraphs in terms of walks
• A lower bound for the spectral radius of graphs with fixed diameter
• The spectral radii of a graph and its line graph
• A spectral Erdős-Rademacher theorem
• A Brualdi-Hoffman-Turán problem on cycles
• Cliques and the spectral radius
• The number of walks in a graph
• 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
• On graphs with exactly three \(Q\)-main eigenvalues
• Turán's theorem implies Stanley's bound
• Eigenvalues of subgraphs of the cube
• On the first two eigenvalues of regular graphs
• On the spectral radius of graphs without a gem
• Signless Laplacian spectral radius of graphs without short cycles or long cycles
• A path forward: tropicalization in extremal combinatorics
• Title not available (Why is that?)
• Support of closed walks and second eigenvalue multiplicity of graphs
• Bounds on the (Laplacian) spectral radius of graphs
• New spectral bounds on the chromatic number encompassing all eigenvalues of the adjacency matrix
• 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
• Spectral extrema of graphs with fixed size: cycles and complete bipartite graphs
• Matrix power inequalities and the number of walks in 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
• New upper bounds on the spectral radius of graphs
• A note on graphs with exactly two main eigenvalues
• 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
• Trees with small spectral gap
• Beyond graph energy: norms of graphs and matrices
• A relationship between the walks and the semi-edge walks of graphs
• Signed spectral Turań-type theorems
• On the spectral radius of minimally 2-(edge)-connected graphs with given size
• Walks and eigenvalues of signed graphs
• Inequalities for the number of walks in graphs
• Counting substructures and eigenvalues. I: Triangles
• Remarks on the largest eigenvalue of a signed graph
• Title not available (Why is that?)

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)