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

I am really stuck on how to work out the tutte polynomial so any help would be great thanks.

G is a graph with 2 vertices, joined by n edges. How to you show what the tutte polynomial is? And what is the relationship between this graph and the graph of Cn? I do understand that they are isomorphic of one another.

share|cite|improve this question

migrated from Aug 8 '13 at 17:06

This question came from our site for professional mathematicians.

Why not have a look at the Wikipedia article? There's a worked example there. If you've understood that, you should be able to work out the Tutte polynomial of your graph. – Tom Leinster Aug 8 '13 at 16:51
Yes, I have read that and it helped a bit however I don't really see the relationship between this graph and Cn. – Samantha Aug 8 '13 at 17:05

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.