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

The book "Graph Theory with applications" by J.A. Bondy and U.S.R. Murty, which is available here. The Theorem $4.6$ of this book says that:

If $G$ is a non-Hamiltonian simple graph with $n≥3$ vertices, then $G$ is degree-majorised by some $C_{m,n}:=K_m \vee (K^c_m+K_{n−2m})$

What does $K^c_m$ mean?

Thanks in advance.

share|cite|improve this question

As per Chapter 1 Exercise 1.2.11, $K_m^c$ denotes the complement of the complete graph $K_m$.

That is, the graph composed of $m$ isolated vertices.

share|cite|improve this answer
Thank you very much! – user68169 Apr 3 '13 at 10:22

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.