Take the 2-minute tour ×
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.
  1. Is there any graph $G$ with $\kappa(G) < \lambda(G) < \delta(G)$?

  2. Is there a graph which has a Euler circuit but no Hamilton Cycle?

$\kappa(G)$ is the vertex connectivity, $\lambda(G)$ is the edge connectivity and $\delta(G)$ is the minimum degree.

share|improve this question
    
I don't know the standard notation in this case, please edit it if these changes aren't right. –  Ian Mateus Nov 16 '13 at 18:09

1 Answer 1

Here is the answer but I recommend you to think once more and then look at the answers. IMO it is very important to try to imagine the graphs for yourself.

For the first part:

enter image description here

For the second part of your question:

Eulerian but not Hamiltonian

share|improve this answer
    
It might be good to have a look at here:mathworld.wolfram.com/VertexConnectivity.html –  hhsaffar Nov 16 '13 at 20:13

Your Answer

 
discard

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.