1 / 5

Finding The Compliment of a Graph

Finding The Compliment of a Graph. Jeffrey Martinez Math 170 Dr. Lipika Deka 12/19/13. Chapter 10.1 Problem #39. Compliment of a Graph. From our text, we find the definition of “The Compliment” of a graph:

nash
Download Presentation

Finding The Compliment of a Graph

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. Finding The Compliment of a Graph Jeffrey Martinez Math 170 Dr. LipikaDeka 12/19/13

  2. Chapter 10.1 Problem #39

  3. Compliment of a Graph • From our text, we find the definition of “The Compliment” of a graph: • Definition: 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 set 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.

  4. Problem #39 part (a) • The Graph of G in part (a) is shown with vertexes from v1 to v2, from v1 to v4, from v2 to v3, and from v2 to v4. • To find the compliment G’, we keep the vertexes the same, but instead connect any vertexes that did not have an edge between them in G. In this case it is from v1 to v3, and from v3 to v4. A rough sketch of G’ is shown below. v2 v3 v1 v4

  5. Problem #39 part (b) • The Graph of G in part (b) is shown with vertexes from v1 to v2, and from v3 to v4. • Once again, like part (a), to find the compliment G’, we keep the vertexes, connecting any vertexes that do not have an edge between them in the graph of G. In this case it is from v1 to v3, from v1 to v4, from v2to v4 and from v2to v3. A rough sketch of G’ is shown below. v2 v1 v3 v4

More Related