If you claim that the graphs are isomorphic, show a bijection and show that your bijection preserves all the edges. If you claim that the graphs are not isomorphic, explain the structural difference between the two graphs. If the graphs are not isomorphic explain how the structure of the graphs are different.

Please don’t the photo of the graph and also what DID YOU BUT IN GEOGEBRA to get that graph because I want to do it on my laptop. Because when I put the containers I don’t get a graph like yours

In a high school class, there are students of different talents (ex. music, art, debate, sports, etc.). A committee needs to be formed consisting of the maximum number of students such that the committee is diverse – no two students with the same talent are in the committee. Transform this problem to a graph theoretic problem. What are the vertices of the graph? What are the edges of the graph? What do you have to find in the graph?

If you claim that the graphs are isomorphic, show a bijection and show that your bijection preserves all the edges. If you claim that the graphs are not isomorphic, explain the structural difference between the two graphs. If the graphs are not isomorphic explain how the structure of the graphs are different.

The sum of the degree of vertices of a graph is always an even number. O True False

Think of a list of six of your colleagues on Facebook and make a graph where each vertex is one of you 7 and an edge with those who are colleagues in that same place