Title of article
A New Upper Bound on the Cheeger Number of a Graph
Author/Authors
Dragomir، نويسنده , , Sorin and Barletta، نويسنده , , Elisabetta، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2001
Pages
8
From page
167
To page
174
Abstract
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.
Journal title
Journal of Combinatorial Theory Series B
Serial Year
2001
Journal title
Journal of Combinatorial Theory Series B
Record number
1526834
Link To Document