Communications in Analysis and Geometry · 1994 · 45 citations · 3 references
ComputingHigh-performance ComputingComputational GeometryGraph TheoryNetwork DiameterLower Bound Theorem
We prove a Harnack inequality for eigenfunctions of certain homogeneous graphs and subgraphs which we call strongly convex. This inequality can be used to derive a lower bound for the (nontrivial) Neumann eigenvalues by l/(8kD 2 ) where k is the maximum degree and D denotes the diameter of the graph.
3
Local Expansion of Symmetrical Graphs
László Babai, Márió Szegedy · Combinatorics Probability Computing · 1992 · 53 citations
T. J. Willmore · Bulletin of the London Mathematical Society · 1989 · 41 citations