1 / 5

Walks, Paths and Circuits

Walks, Paths and Circuits. A graph is a connected graph if it is possible to travel from one vertex to any other vertex by moving along successive edges. A graph is a disconnected graph if it is not possible to travel from one vertex to any other vertex by moving along successive edges .

taber
Télécharger la présentation

Walks, Paths and Circuits

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. Walks, Paths and Circuits

  2. A graph is a connected graph if it is possible to travel from one vertex to any other vertex by moving along successive edges. A graph is a disconnected graph if it is not possible to travel from one vertex to any other vertex by moving along successive edges. Examples:

  3. A Bridge in a connected graph is an edge such that if it were removed the graph is no longer connected.

  4. Vocabulary A walk is a series of adjacent vertices that can go backwards as long as there is a line segment. A path is a walk which does not repeat vertices. A Circuit is a path whose endpoints are the same vertex. Note: you start and finish with the same vertex without repeating any edges.

More Related