Permutation Inequalities for Walks in Graphs

Abstract

Using spectral graph theory, we show how to obtain inequalities for the number of walks in graphs from nonnegative polynomials and present a new family of such inequalities