Number of walks and degree powers in a graph
classification
🧮 math.CO
math.SP
keywords
numberpowerswalksdegreesgraphboundeddealsdegree
read the original abstract
This note deals with the relationship between the total number of $k$-walks in a graph, and the sum of the $k$-th powers of its vertex degrees. In particular, it is shown that the the number of all $k$-walks is upper bounded by the sum of the $k$-th powers of the degrees.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.