MathOverflow is a question and answer site for professional mathematicians. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Suppose $G=(V,E)$ is a connected d-regular graph, possibly with loops and multiple edges. I'm interested in finding a lower bound for the smallest non-zero eigenvalue of the Laplacian in this setting. Therefore I was wondering:

Is there a generalization of Cheeger's inequality for non-simple graphs, relating the conductance to the size of the smallest non-zero eigenvalue?

share|cite|improve this question

As far as I know, Cheeger's inequality does hold for non-simple graphs. If you look at Chung's book 'Spectral graph theory' she first treats simple graphs and then weighted graphs, which are even more general than loops and multiple edges. Her proof seems to hold for weighted graphs as well.

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.