Hi all,(adsbygoogle = window.adsbygoogle || []).push({});

If I have to prove that the graph G and its complement G' are isomorphic, then is it enough to prove that both G and G' will have the same number of edges. Intuitively its clear to me, but how do I prove this. If there's a counterexample, please post.

Thanks in advance.

**Physics Forums - The Fusion of Science and Community**

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Isomorphism in graphs

Loading...

Similar Threads - Isomorphism graphs | Date |
---|---|

Check for Isomorphism in Hypergraphs | Oct 16, 2014 |

Isomorphism between divisible groups | Jun 5, 2012 |

Is 2Z isomorphic to 4Z? (Abstract algebra) | Apr 3, 2012 |

How to prove that 2 graphs are not isomorphic? | Mar 19, 2011 |

How many graph isomorphic classes are there given n vertices? | Jun 11, 2009 |

**Physics Forums - The Fusion of Science and Community**