Inequalities for the number of walks in graphs
From MaRDI portal
(Redirected from Publication:378237)
Recommendations
Cites work
- scientific article; zbMATH DE number 1618184 (Why is no real title available?)
- scientific article; zbMATH DE number 5841869 (Why is no real title available?)
- scientific article; zbMATH DE number 1330692 (Why is no real title available?)
- scientific article; zbMATH DE number 3324507 (Why is no real title available?)
- scientific article; zbMATH DE number 3349875 (Why is no real title available?)
- scientific article; zbMATH DE number 3372065 (Why is no real title available?)
- scientific article; zbMATH DE number 3377258 (Why is no real title available?)
- scientific article; zbMATH DE number 964896 (Why is no real title available?)
- A Holder Type Inequality for Symmetric Matrices with Nonnegative Entries
- A Note on Almost Regular Graphs
- A sharp lower bound of the spactral radius of simple graphs
- An Inequality Arising in Genetical Theory
- An upper bound on the sum of squares of degrees in a graph
- Compactness results in extremal graph theory
- Comparing Zagreb \(M1\) and \(M2\) indices for acyclic molecules
- Derandomized graph products
- Eigenspaces of graphs
- Extremal trees with given degree sequence for the Randić index
- Graph spectra for complex networks
- Graphs with maximal number of adjacent pairs of edges
- Hölder type inequalities in cones
- Inequalities for the number of walks in graphs
- Inequalities in quadratic forms
- Network Analysis
- Number of walks and degree powers in a graph
- On comparing Zagreb indices
- On the spectral radius of graphs
- On the spectral radius, \(k\)-degree and the upper bound of energy in a graph
- Recent results in the theory of graph spectra
- Sharp upper and lower bounds for largest eigenvalue of the Laplacian matrices of trees
- Some applications of eigenvalues of graphs
- Spectral Radius and Degree Sequence
- Spectral bounds for the clique and independence numbers of graphs
- Spektren endlicher Grafen
- Symmetric space-bounded computation
- The Eigenvalues of a Graph and Its Chromatic Number
- The dense \(k\)-subgraph problem
- The largest eigenvalue of a graph: A survey
- The number of walks in a graph
- The spectral approach to determining the number of walks in a graph
- The sum of the elements of the powers of a matrix
- The sum of the squares of degrees: sharp asymptotics
- Three observations on nonnegative matrices
- Two inequalities in nonnegative symmetric matrices
- Walks and the spectral radius of graphs
Cited in
(14)- A new proof of the Erdős-Simonovits conjecture on walks
- Bounds on the number of closed walks in a graph and its applications
- Walks and paths in trees
- Comparing large-scale graphs based on quantum probability theory
- Lower and upper bounds on graph communicabilities
- Matrix power inequalities and the number of walks in graphs
- On majorization of closed walk vectors of trees with given degree sequences
- Inequalities for the number of walks in graphs
- Inequalities for the number of walks in subdivision graphs
- Chebyshev's Sum Inequality and the Zagreb Indices Inequality
- Number of walks and degree powers in a graph
- Basic trigonometric power sums with applications
- scientific article; zbMATH DE number 2104724 (Why is no real title available?)
- A path forward: tropicalization in extremal combinatorics
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)
