Results 1 to 2 of 2

Math Help - Graph Proofs- Isomorphic

  1. #1
    Junior Member
    Joined
    Mar 2009
    Posts
    44

    Graph Proofs- Isomorphic

    Let G be a graph with n vertices. Prove that there is a subgraph of Kn isomorphic to G.


    Im unsure how to explain a proof for this. Would I just mention the 4 properties required for a graph to be isomorphic.
    Follow Math Help Forum on Facebook and Google+

  2. #2
    Newbie
    Joined
    Aug 2008
    Posts
    17
    Make the given graph G as a complete graph K_n by joining all non adjacent vertices. Then obviously K_n contains G as an induced subgraph upto isomorphism.
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. Replies: 2
    Last Post: March 2nd 2011, 05:39 AM
  2. Isomorphic Graph
    Posted in the Discrete Math Forum
    Replies: 2
    Last Post: October 24th 2010, 01:28 PM
  3. graph proofs
    Posted in the Discrete Math Forum
    Replies: 3
    Last Post: September 3rd 2009, 07:52 AM
  4. isomorphic graph, planar graph
    Posted in the Discrete Math Forum
    Replies: 1
    Last Post: May 9th 2009, 08:13 AM
  5. isomorphic proofs
    Posted in the Advanced Algebra Forum
    Replies: 1
    Last Post: November 23rd 2006, 10:57 AM

Search Tags


/mathhelpforum @mathhelpforum