Inequalities for the number of walks in graphs
DOI10.1007/S00453-013-9766-3zbMATH Open1275.05028OpenAlexW2000198292MaRDI QIDQ378237FDOQ378237
Authors: Hanjo Täubig, Jeremias Weihmann, Sven Kosub, Raymond Hemmecke, Ernst W. Mayr 
Publication date: 11 November 2013
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-013-9766-3
Recommendations
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Enumeration in graph theory (05C30) Paths and cycles (05C38) Random walks on graphs (05C81) Graph theory (05C99)
Cites Work
- Title not available (Why is that?)
- Eigenspaces of graphs
- On the spectral radius, \(k\)-degree and the upper bound of energy in a graph
- Title not available (Why is that?)
- The dense \(k\)-subgraph problem
- Extremal trees with given degree sequence for the Randić index
- Recent results in the theory of graph spectra
- On the spectral radius of graphs
- Spektren endlicher Grafen
- Derandomized graph products
- Sharp upper and lower bounds for largest eigenvalue of the Laplacian matrices of trees
- Graphs with maximal number of adjacent pairs of edges
- Title not available (Why is that?)
- Compactness results in extremal graph theory
- Graph spectra for complex networks
- 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
- Two inequalities in nonnegative symmetric matrices
- Three observations on nonnegative matrices
- On comparing Zagreb indices
- Number of walks and degree powers in a graph
- 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
- An upper bound on the sum of squares of degrees in a graph
- The sum of the squares of degrees: sharp asymptotics
- Hölder type inequalities in cones
- Inequalities in quadratic forms
- Some applications of eigenvalues of graphs
- Title not available (Why is that?)
- An Inequality Arising in Genetical Theory
- Spectral Radius and Degree Sequence
- A sharp lower bound of the spactral radius of simple graphs
- A Note on Almost Regular Graphs
- Inequalities for the Number of Walks in Graphs
- Comparing Zagreb \(M1\) and \(M2\) indices for acyclic molecules
- The Eigenvalues of a Graph and Its Chromatic Number
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Network Analysis
- The spectral approach to determining the number of walks in a graph
Cited In (11)
- Number of walks and degree powers in a graph
- Comparing large-scale graphs based on quantum probability theory
- Chebyshev's Sum Inequality and the Zagreb Indices Inequality
- On majorization of closed walk vectors of trees with given degree sequences
- A new proof of the Erdős-Simonovits conjecture on walks
- A path forward: tropicalization in extremal combinatorics
- Lower and upper bounds on graph communicabilities
- Matrix power inequalities and the number of walks in graphs
- Walks and paths in trees
- Basic trigonometric power sums with applications
- Title not available (Why is that?)
This page was built for publication: Inequalities for 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 Q378237)
