A New Upper Bound on the Cheeger Number of a Graph

Using a technique developed by A. Nilli (1991, Discrete Math.91, 207–210), we estimate from above the Cheeger number of a finite connected graph G of small degree (Δ(G)⩽5) admitting sufficiently distant edges.