Math 224 homework vii | Mathematics homework help

 MATH 224 Homework VII                                                                                                   


This homework is due at the preface of assort on Tuesday, December 8.


For all topics in this homework, suppose that the vertex set of the graphs G1, G2, G3, G4, G5, and G6 is the identical vertex set V = {Alice, Bob, Candice, Darron, Eric}. The party sets of these graphs are defined as follows:

1. Pull all six graphs G1, G2, G3, G4, G5, and G6.

3. Pick any three of the six graphs and pull the adjacency matrix of the graphs that you picked.

2. There is correspondently one two of graphs Gi and Gj (i ≠ j) that are isomorphic to each other. Propound the two parallel after a while an isomorphic map among them, namely a mapping f : V V of the vertices Gi  to the vertices of Gj such that u and v are neighboring in Gi if and barely if f(u) and f(v) are neighboring in Gj.

4. For each of the six graphs G1, G2, G3, G4, G5, and G6, propound the limit classification vector limits = < limit(Alice), limit(Bob), limit(Candice), limit(Darron), limit(Eric) >.

5. There is correspondently one graph that is isomorphic to the total graph K5. Which one is it?

6. using the limit classifications that you already congenial, reason as to why no other two of graphs (separate from those you answered in topic two) could be isomorphic to each other.