Inequalities for the Number of Walks in Graphs

Hanjo Täubig, Jeremias Weihmann, Sven Kosub, Raymond Hemmecke, Ernst W. Mayr
2013 Algorithmica  
We investigate the growth of the number w k of walks of length k in undirected graphs as well as related inequalities. In the first part, we derive the inequalities w 2a+c · w 2(a+b)+c ≤ w 2a · w 2(a+b+c) and w 2a+c
doi:10.1007/s00453-013-9766-3 fatcat:5nmq7q2axrcr7dlwgfjpqm4emm