1 / 6

Group 11,Part three, # 40

Group 11,Part three, # 40. Omar Monroy Bianca Orozco Jeffrey Martinez. Definition:. v2.

avital
Download Presentation

Group 11,Part three, # 40

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Group 11,Part three, # 40 Omar Monroy Bianca Orozco Jeffrey Martinez

  2. Definition: v2 If G is a simple graph, the complement of G, denoted Gˊ, is obtained as follows : The vertex set of Gˊ is identical to the vertex of G. However, two distinct vertices v and w of Gˊ are connected by an edge if, and only if, v and w are not connected by an edge in G. For example, if G is the graph Then Gˊ is v1 v3 v4 v2 v3 v1 v4

  3. # 40 a.) Find the complement of the graph K G is Then Gˊ is 4 v2 v3 v4 v1 v3 v2 v4 v1

  4. 3,2 v1 w1 b.) Find the complement of the graph k G is Then Gˊ is v2 w2 v3 w1 w2 v2 v1 v3

  5. Summery When asked for the complement of a graph, being simple or Bipartite, Essentially what you must do is find the vertices and see if it is connected to any others. The reason for this is because the complement would be that those vertices are not connected. Furthermore if G has vertices that don’t connect then the complement would be that they do connect.

  6. Bibliography Epp, S. S. (2010). Graph theory. In Discrete Mathematics with Applications (pp. 633,641…). Belmont, CA: Brooks/Cole-Thomas Learning.

More Related