Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

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

I'm curious about some terminology for graphs and the existence of an algorithm. Let $G$ be a graph and $H \leq G$ a subgraph. Is there a name given to $H$ if $|N(H)|$ is minimum over all subgraphs of size $|H|$? Are there algorithms to compute such a set rather than brute force?

share|cite|improve this question
up vote 1 down vote accepted

If by $|N(H)|$ you mean neighborhood of $H$, then this is close to the notion of graph expansion.

As for your last question, I am positive, judging from inherent difficulty of calculating other expansion rates, I bet this one would be a hard problem as well. I am not sure, if there is nothing better than a brute force algorithm, but even if there is I wouldn't expect it to break the exponential barrier.

EDIT: Typos

share|cite|improve this answer
Thanks, that will give me something to work from. I don't have any votes left for today so if no one says anything else by the morning, I will +1 and accept this. – muzzlator Apr 11 '13 at 19:02
Cheers mate! If you need anything more let me know. – KXK Apr 11 '13 at 19:13

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.