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

A graph $G$ has $n$ vertices. Prove that $G$ is connected if and only if we can find an injective sequence ($\ v_{1}...v_{n}$) such that for each $i>1$ there exists $j < i$ with $\ v_{i} v_{j}$ $\in$ E(G).

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

Proof by induction. $n=1$ both things are vacuously true. $n=2$ both statements hold if the two vertices are connected, both fail if they are not.

Suppose now $n>2$. If $G$ is connected, then some vertex $v$ can be removed without disconnecting the graph. proof $G\setminus \{v\}$ now has $n-1$ vertices, and remains connected. By induction, take the injective sequence, then put vertex $v$ at the end. If instead we have an injective sequence $(v_1, \ldots, v_n)$, then $(v_1,\ldots, v_{n-1})$ is an injective sequence and its corresponding graph $G\setminus \{v_n\}$ is connected. But now $v_n$ is connected to one of the other vertices by the property you are giving injective sequences.

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.