A New Upper Bound on the Cheeger Number of a Graph

@article{Dragomir2001ANU,
  title={A New Upper Bound on the Cheeger Number of a Graph},
  author={Sorin Dragomir and Elisabetta Barletta},
  journal={J. Comb. Theory, Ser. B},
  year={2001},
  volume={82},
  pages={167-174}
}
where X(G) is the set of all parts X/V(G) so that X{< and X =V(G)"X{<. Also, E(A, B) is the set of all A B edges in G and Vol(A)= x # A mG(x). Here mG(x) is the degree of the vertex x in G. For instance, the Cheeger number of the complete graph K on N vertices is h(K)=N [2(N&1)]. Also, the Cheeger number of a claw (or star) K1, N=K V K is h(K1, N)=1. In… CONTINUE READING