12 research outputs found
Number of walks and degree powers in a graph
This note deals with the relationship between the total number of -walks
in a graph, and the sum of the -th powers of its vertex degrees. In
particular, it is shown that the the number of all -walks is upper bounded
by the sum of the -th powers of the degrees
Number of walks and degree powers in a graph
This letter 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 sum of all k-walks is upper bounded by the sum of the k-th powers of the degrees