Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. 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

Let $G$ be a Petersen graph and $S\subset V(G)$,

how can I compute $e(G[S])$ for non-trivial $S$?

Here $G[S]$ is the induced subgraph of $G$ and $e(G[S])$ is the number of edges of $G[S]$. I think this should be a function of $|S|$, i.e., the size of $|S|$. For specified $S$, say, the five vertices in a 5-cycle, one can come up with $$ e(G[S])=|S|=5.\quad[\text{EDITED}] $$ But I have no idea how to approach this problem for general $S$.

[EDITED:] Can I bound $e(G[S])$ by a function of $|S|$?

enter image description here

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

First of all, I would say that for $S$ being the vertices of a 5-cycle you get $e(G[S])=5$, since in an induced subgraph, you have only the edges between the vertices of $S$.

Moreover, this is not a function in $|S|$. Consider this example of a 5-elementary set $S$. enter image description here

Here you get $e(G[S])=2$.

If you ask how to compute it, then simply test for every edge if its endpoints are both in $S$.

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.