1 / 8

Graph Theory

Graph Theory. By Amy C. and John M. What is Graph Theory?. Graph Theory is the study of graphs It concerns the relationship among lines and points. It is also one of the most important areas of applied mathematics. History. Why is Graph Theory Important???.

deiter
Download Presentation

Graph Theory

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. Graph Theory By Amy C. and John M.

  2. What is Graph Theory? • Graph Theory is the study of graphs • It concerns the relationship among lines and points. • It is also one of the most important areas of applied mathematics. • History

  3. Why is Graph Theory Important??? • Graph theory is important because of its’ applications. • Can be used to map out cellular telephone networks by using each persons phone and antenna as nodes and the segments would be the calls to one another. • It is used to model problems in virtually all the applied sciences.

  4. Basic Definitions • Graph: A graph is collection of nodes in which various pairs of nodes are connected by line segments. • Vertex: This typically means a corner or a point where lines meet. • Edge: This is a line segment that connects two vertices.

  5. Basic Definitions (cont.) • Directed Graph: Line segments have arrowheads on them indicating direction. • Undirected Graph: Line segments have no arrowheads on them. • Weighted Graph: These are digraphs in which numbers called weights are attached to the directed edges. • Path: A path is a sequence of vertices in which each vertex is adjacent to the next one.

  6. More Definitions • Length: The number of edges in a path is called the length. • Cycle: This is a path of length greater than one that begins and ends at the same vertex. • Loop: An edge with both ends the same. • Adjacency Matrix: This is an nxn matrix where n is the number of vertices in the graph.

  7. Matrix Example • The matrix A is called the adjacency matrix of the graph. • The adjacency matrix for the graph is given by

  8. Examples in the Future • The programming example we will be doing in a later presentation is called Graph Searching. • To search a graph, you need to visit all the vertices in a systematic order. • Illustrative examples that we will be presenting are called “Instant Insanity”, the “Shortest Path”, and the “Four Color Theorem Problem”.

More Related