Is there a graph with exactly 3 components, exactly 2 of them not isomorphic? If so, give the example. If not, explain.

Please help.

Printable View

- September 30th 2009, 04:59 AMzhupolongjoeGraph isomorphism...example help please
Is there a graph with exactly 3 components, exactly 2 of them not isomorphic? If so, give the example. If not, explain.

Please help. - September 30th 2009, 07:14 AMPlato
- September 30th 2009, 08:14 AMzhupolongjoe
Hmm...No it is not. Because if A and B are the exactly two non-isomorphic graphs, then C must be isomorphic to something, but if it is isomorphic to A, there is only one nonisomorphic component. A contradiction.

Is it that simple?