Matrix power inequalities and the number of walks in graphs
From MaRDI portal
Publication:403573
DOI10.1016/J.DAM.2013.10.002zbMATH Open1298.05209OpenAlexW2088326793MaRDI QIDQ403573FDOQ403573
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
Recommendations
inequalitiesspectral radiusadjacency matrixHermitian matrixlargest eigenvaluenonnegative matrixmatrix powernumber of walkssum of entries
Cites Work
- On the spectral radius, \(k\)-degree and the upper bound of energy in a graph
- Title not available (Why is that?)
- On the spectral radius of graphs
- Spektren endlicher Grafen
- Sharp upper and lower bounds for largest eigenvalue of the Laplacian matrices of trees
- Compactness results in extremal graph theory
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Holder Type Inequality for Symmetric Matrices with Nonnegative Entries
- The largest eigenvalue of a graph: A survey
- Title not available (Why is that?)
- Walks and the spectral radius of graphs
- On comparing Zagreb indices
- 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
- 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
- Inequalities for the number of walks in graphs
- A Note on Almost Regular Graphs
- Network Analysis
- Title not available (Why is that?)
Cited In (3)
This page was built for publication: Matrix power inequalities and the number of walks in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q403573)
