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.

How many new graphs that are not isomorphic will I have by removing any of its edges (but only one!) ?
enter image description here

I did following:
enter image description here
Where the numbers mean which graph will I get by removing corresponding edge. When the numbers are the same that means that removing edges with same number will create same graph ( = isomorphic)
My answer would be 6 graphs, but in the key there is 5 as answer.
Sorry for my english.

share|improve this question
6  
Removing 1 or 3 produces isomorphic graphs, so in total you get 5 possible graphs under isomorphism :) –  wircho Nov 30 '12 at 16:30
    
@wircho Ahh, that's true, my bad. Thanks :-/ –  Noturab Nov 30 '12 at 16:32
    
@wircho: Perhaps you could convert that comment to an answer and get this question off the Unanswered list. –  Brian M. Scott Nov 30 '12 at 19:57

1 Answer 1

up vote 1 down vote accepted

From my comment above:

Removing 1 or 3 produces isomorphic graphs, so in total you get 5 possible graphs under isomorphism :)

share|improve this answer

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.