1 / 94

Chapter 4

Chapter 4. Graphs. 4.1 GRAPHS AND THEIR REPRESENTATIONS. Other Representations of Graphs. Isomorphism. 4.2 PATHS AND CIRCUITS.

kaida
Download Presentation

Chapter 4

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. Chapter 4 Graphs

  2. 4.1 GRAPHS AND THEIR REPRESENTATIONS

  3. Other Representations of Graphs

  4. Isomorphism

  5. 4.2 PATHS AND CIRCUITS • A multigraph consists of a nonempty finite set of vertices and a set of edges, where we allow an edge to join a vertex to itself or to a different vertex, and where we allow several edges joining the same pair of vertices. An edge from a vertex to itself is called a loop. When there is more than one edge between two vertices, these edges are called parallel edges.

  6. Euler Circuits and Paths

  7. 4.3 SHORTEST PATHS AND DISTANCE

More Related