Number of walks and degree powers in a graph
Combinatorics
2012-06-06 v1 Spectral Theory
Abstract
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.
Cite
@article{arxiv.1206.0860,
title = {Number of walks and degree powers in a graph},
author = {M. A. Fiol and E. Garriga},
journal= {arXiv preprint arXiv:1206.0860},
year = {2012}
}