Matrix power inequalities and the number of walks in graphs

DOI10.1016/j.dam.2013.10.002zbMath1298.05209OpenAlexW2088326793MaRDI QIDQ403573

Jeremias Weihmann, Hanjo Täubig

Publication date: 29 August 2014

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2013.10.002

zbMATH Keywords

inequalitiesspectral radiusnonnegative matrixadjacency matrixlargest eigenvalueHermitian matrixmatrix powernumber of walkssum of entries

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Random walks on graphs (05C81)

Related Items (3)

Counting trees in graphs ⋮ Chebyshev's Sum Inequality and the Zagreb Indices Inequality ⋮ Impact of Network Structure on New Service Pricing

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Inequalities for the number of walks in graphs
• Spektren endlicher Grafen
• Walks and the spectral radius of graphs
• Spectral bounds for the clique and independence numbers of graphs
• The sum of the elements of the powers of a matrix
• Symmetric space-bounded computation
• The number of walks in a graph
• On the spectral radius of graphs
• Compactness results in extremal graph theory
• Sharp upper and lower bounds for largest eigenvalue of the Laplacian matrices of trees
• Hölder type inequalities in cones
• Inequalities in quadratic forms
• Some Applications of Eigenvalues of Graphs
• An Inequality Arising in Genetical Theory
• Spectral Radius and Degree Sequence
• On comparing Zagreb indices
• The largest eigenvalue of a graph: A survey
• A Note on Almost Regular Graphs
• A Holder Type Inequality for Symmetric Matrices with Nonnegative Entries
• Network Analysis

This page was built for publication: Matrix power inequalities and the number of walks in graphs