Graphs 10 1 Graphs and Graph Models 1
- Slides: 10
Graphs 10. 1 Graphs and Graph Models 1 Dr. Halimah Alshehri
The main purpose for this lesson is to introduce the following: ü Define some concepts of graphs. ü The Types of Graphs. ü Define directed & Undirected Graphs and types of them. 2 Dr. Halimah Alshehri
Graphs DEFINITION 1 • A graph G = ( V , E) consists of V, a nonempty set of vertices (or nodes) and E, a set of edges. • Each edge has either one or two vertices associated with it, called its endpoints. • An edge is said to connect its endpoints. • A graph with an infinite vertex set or an infinite number of edges is called an infinite graph. • a graph with a finite vertex set and a finite edge set is called a finite graph. 3 Dr. Halimah Alshehri
The Types of Graphs • Simple graph: A graph in which each edge connects two different vertices and where no two edges connect the same pair of vertices. 4 Dr. Halimah Alshehri
• Multigraphs: Graphs that may have multiple edges connecting the same vertices. • Loop is a closed curve whose initial and final vertices coincide. 5 Dr. Halimah Alshehri
• Pseudographs : Graphs that may include loops, (and possibly multiple edges connecting the same pair of vertices). 6 Dr. Halimah Alshehri
Directed & Undirected Graphs Definition 2 • A directed graph (or digraph) ( V, E) consists of a nonempty set of vertices V and a set of directed edges (or arcs) E. • Each directed edge is associated with an ordered pair of vertices. • The directed edge associated with the ordered pair (u , v) is said to start at u and end at v. • undirected graphs. Their edges are also said to be undirected. 7 Dr. Halimah Alshehri
Types of Directed & Undirected Graphs • simple directed graph a directed graph that has no loops and has no multiple directed edges. • Directed multigraphs: directed graphs that may have multiple directed edges. • Edge of multiplicity m When there are m directed edges, each associated to an ordered pair of vertices (u, v). 8 Dr. Halimah Alshehri
Mixed graph: a graph with both directed and undirected edges. 9 Dr. Halimah Alshehri
Homework Page 650 • 3 • 4 • 5 • 7 • 9 10 Dr. Halimah Alshehri
- Modal and semi modals
- Chapter 1 graphs functions and models answers
- Networks and graphs: circuits, paths, and graph structures
- State bugs in software testing
- Graphs that enlighten and graphs that deceive
- Algorithmic graph theory and perfect graphs
- Representing graphs and graph isomorphism
- Representing graphs and graph isomorphism
- Comparing distance/time graphs to speed/time graphs
- End behavior chart
- Resource allocation graph and wait for graph