Scribd Logo
Upload

Welcome to Scribd!

  • 13 views

    Math-273: Homework 2 Solutions: Tuesday, January 26, 2010

    Uploaded by

    dip0007
    The document contains solutions to homework problems from a math course. It summarizes that: 1) The largest clique in the given graph is size 4, and the largest independent set is size 2. 2) The first and second graphs are isomorphic under a described automorphism, but the third graph is not isomorphic to them. 3) The first, second, and fifth graphs are pairwise isomorphic under described vertex labelings, as are the third and fourth graphs. However, the sets containing the first/fifth and third/fourth graphs are distinct isomorphism classes.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content

    You might also like

    Math-273: Homework 2 Solutions: Tuesday, January 26, 2010

    Uploaded by

    dip0007
    13 views4 pages
    The document contains solutions to homework problems from a math course. It summarizes that: 1) The largest clique in the given graph is size 4, and the largest independent set is size 2. 2) The first and second graphs are isomorphic under a described automorphism, but the third graph is not isomorphic to them. 3) The first, second, and fifth graphs are pairwise isomorphic under described vertex labelings, as are the third and fourth graphs. However, the sets containing the first/fifth and third/fourth graphs are distinct isomorphism classes.

    Original Description:

    Original Title

    F72EAd01

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document contains solutions to homework problems from a math course. It summarizes that: 1) The largest clique in the given graph is size 4, and the largest independent set is size 2. 2) The first and second graphs are isomorphic under a described automorphism, but the third graph is not isomorphic to them. 3) The first, second, and fifth graphs are pairwise isomorphic under described vertex labelings, as are the third and fourth graphs. However, the sets containing the first/fifth and third/fourth graphs are distinct isomorphism classes.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    13 views4 pages

    Math-273: Homework 2 Solutions: Tuesday, January 26, 2010

    Uploaded by

    dip0007
    The document contains solutions to homework problems from a math course. It summarizes that: 1) The largest clique in the given graph is size 4, and the largest independent set is size 2. 2) The first and second graphs are isomorphic under a described automorphism, but the third graph is not isomorphic to them. 3) The first, second, and fifth graphs are pairwise isomorphic under described vertex labelings, as are the third and fourth graphs. However, the sets containing the first/fifth and third/fourth graphs are distinct isomorphism classes.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 4

    Math-273: Homework 2 Solutions

    Tuesday, January 26, 2010


    1.1.11. Determine the maximum size of a clique and the maximum size of an independent set in the graph below.

    Proof. Since the clique of size 5 requires 5 vertices of degree 4 and G has only 4 vertices of degree 4, the maximum size of a clique contained by G must be at most 4. The following graph depicts just such a clique.

    Therefore, the largest clique contained by G is that of size 4.

    Now, consider the vertices e and f ; both are adjacent to every vertex in G and therefore cannot be elements of any independent set larger than size 1. Hence, any independent set larger than size 1 must be formed using the four remaining vertices. Selecting any of the three remaining vertices guarantees that two of them are pairwise adjacent. So, the largest independent set must be at most size 2. The set {a, d } exhibits just such a set. Therefore, the largest independent set is of size 2. 1.1.18. Determine which pair of graphs below are isomorphic.

    Proof. Let G1 , G2 and G3 be the graphs starting from left to right. G1 is isomorphic to G2 , as demonstrated by the following automorphism of G1 :

    Consider the following subgraph of G3 .

    Blake Farman

    This subgraph of G3 is not bipartite and, because G1 and G2 are both bipartite, G3 (G1 G2 ). = = 1.1.22. Determine which pairs of graphs below are isomorphic, presenting the proof by testing the smallest possible number of pairs. Proof. Let the graphs be named G1 , G2 , G3 , G4 , G5 from left to right. The following labelings of the vertices show that {G1 , G2 , G5 } is a pairwise isomorphic.

    The following labelings of the vertices show that G3 and G4 are isomorphic.

    Blake Farman

    Considering G1 and G3 as representatives from their respective isomorphism classes, in G1 any vertex is a point in three different triangles. However, in G3 this is not the case; observe the following subgraph of G3 .

    The vertex t is a part of only two different triangles. Thus, it must be that the two sets are subsets of distinct isomorphism classes.

    Blake Farman

    You might also like