Problem 5. If G is a simple graph, let G be the graph with the same set of vertices, but where there is an edge from v to w in G if and only if there is not an edge from v to w in G. (a) Find a simple graph so that G and G are not isomorphic. (b) Find a simple graph so that G and G are isomorphic. (c) Show that if G1 and G2 are graphs, then G1 and G2 are isomorphic if and only if G1 and G2 are isomorphic.

Problem 5. If G is a simple graph, let G be the graph with the same set of vertices, but where there is an edge from v to w in G if and only if there is not an edge from v to w in G. (a) Find a simple graph so that G and G are not isomorphic. (b) Find a simple graph so that G and G are isomorphic. (c) Show that if G1 and G2 are graphs, then G1 and G2 are isomorphic if and only if G1 and G2 are isomorphic.

Algebra and Trigonometry (MindTap Course List)

4th Edition

ISBN:9781305071742

Author:James Stewart, Lothar Redlin, Saleem Watson

Publisher:James Stewart, Lothar Redlin, Saleem Watson

Chapter1: Equations And Graphs

Section1.2: Graphs Of Equations In Two Variables; Circles

Problem 5E: a If a graph is symmetric with respect to the x-axis and (a,b) is on the graph, then (,) is also on...

See similar textbooks