Number of walks and degree powers in a graph

DOI10.1016/j.disc.2008.03.025zbMath1228.05171arXiv1206.0860OpenAlexW2023055866MaRDI QIDQ1025536

E. Garriga, Miquel Àngel Fiol

Publication date: 19 June 2009

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

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

zbMATH Keywords

graphadjacency matrixLaplacian matrixwalksdegree powers

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Paths and cycles (05C38)

Related Items (12)

Ordering starlike trees by the totality of their spectral moments ⋮ The maximum outdegree power of complete \(k\)-partite oriented graphs ⋮ Bounds on the number of closed walks in a graph and its applications ⋮ Counting Walks and Graph Homomorphisms via Markov Chains and Importance Sampling ⋮ Inequalities for the number of walks in graphs ⋮ Influence of assortativity and degree-preserving rewiring on the spectra of networks ⋮ Graph homomorphisms between trees ⋮ Extremality of degree-based graph entropies ⋮ On the spectral invariants of symmetric matrices with applications in the spectral graph theory ⋮ Comparing large-scale graphs based on quantum probability theory ⋮ Degree powers in \(K_{s,t}\)-minor free graphs ⋮ On local weak limit and subgraph counts for sparse random graphs

Cites Work

• A Turán type problem concerning the powers of the degrees of a graph
• An upper bound on the sum of squares of degrees in a graph
• Maximizing the sum of the squares of the degrees of a graph
• Degree powers in graphs with forbidden subgraphs
• Sums of powers of the degrees of a graph
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Number of walks and degree powers in a graph