A Harnack inequality for homogeneous graphs and subgraphs

Abstract

We prove a Harnack inequality for eigenfunctions of certain homogeneous graphs and sub-graphs which we call strongly convex. This inequality can be used to derive a lower bound for the (nontrivial) Neumann eigenvalues by 1/(8kD 2) where k is the maximum degree and D denotes the diameter of the graph.