Graph Theory By Amy C. and John M..

Slides:



Advertisements
Similar presentations
Graphs and Finding your way in the wilderness
Advertisements

Graphs CSCI 2720 Spring 2005.
Introduction to Graph Theory Instructor: Dr. Chaudhary Department of Computer Science Millersville University Reading Assignment Chapter 1.
Midwestern State University Department of Computer Science Dr. Ranette Halverson CMPS 2433 – CHAPTER 4 GRAPHS 1.
Graph-02.
CS 206 Introduction to Computer Science II 03 / 27 / 2009 Instructor: Michael Eckmann.
Graphs Chapter 12. Chapter Objectives  To become familiar with graph terminology and the different types of graphs  To study a Graph ADT and different.
Midwestern State University Department of Computer Science Dr. Ranette Halverson CMPS 2433 CHAPTER 4 - PART 2 GRAPHS 1.
 Graph Graph  Types of Graphs Types of Graphs  Data Structures to Store Graphs Data Structures to Store Graphs  Graph Definitions Graph Definitions.
CS 206 Introduction to Computer Science II 11 / 11 / Veterans Day Instructor: Michael Eckmann.
1 Representing Graphs. 2 Adjacency Matrix Suppose we have a graph G with n nodes. The adjacency matrix is the n x n matrix A=[a ij ] with: a ij = 1 if.
Graphs Chapter 12. Chapter 12: Graphs2 Chapter Objectives To become familiar with graph terminology and the different types of graphs To study a Graph.
CSE 321 Discrete Structures Winter 2008 Lecture 25 Graph Theory.
Fall 2007CS 2251 Graphs Chapter 12. Fall 2007CS 2252 Chapter Objectives To become familiar with graph terminology and the different types of graphs To.
CISC220 Fall 2009 James Atlas Nov 13: Graphs, Line Intersections.
Chapter 4 Graphs.
Chapter 11 Graphs and Trees This handout: Terminology of Graphs Eulerian Cycles.
Graphs CS /02/05 Graphs Slide 2 Copyright 2005, by the authors of these slides, and Ateneo de Manila University. All rights reserved Definition.
Computer Science 112 Fundamentals of Programming II Introduction to Graphs.
© 2006 Pearson Addison-Wesley. All rights reserved14 A-1 Chapter 14 Graphs.
Graphs. What is a graph? A data structure that consists of a set of nodes (vertices) and a set of edges that relate the nodes to each other The set of.
 What is a graph? What is a graph?  Directed vs. undirected graphs Directed vs. undirected graphs  Trees vs graphs Trees vs graphs  Terminology: Degree.
Nyhoff, ADTs, Data Structures and Problem Solving with C++, Second Edition, © 2005 Pearson Education, Inc. All rights reserved Graphs.
Graphs. Definitions A graph is two sets. A graph is two sets. –A set of nodes or vertices V –A set of edges E Edges connect nodes. Edges connect nodes.
Computer Science: A Structured Programming Approach Using C Graphs A graph is a collection of nodes, called vertices, and a collection of segments,
COSC 2007 Data Structures II Chapter 14 Graphs I.
The Structure of the Web. Getting to knowing the Web How big is the web and how do you measure it? How many people use the web? How many use search engines?
1.5 Graph Theory. Graph Theory The Branch of mathematics in which graphs and networks are used to solve problems.
Graph Theory. A branch of math in which graphs are used to solve a problem. It is unlike a Cartesian graph that we used throughout our younger years of.
Graphs. Graphs Similar to the graphs you’ve known since the 5 th grade: line graphs, bar graphs, etc., but more general. Those mathematical graphs are.
Graphs A graphs is an abstract representation of a set of objects, called vertices or nodes, where some pairs of the objects are connected by links, called.
© Nuffield Foundation 2012 Nuffield Free-Standing Mathematics Activity Networks © Rudolf Stricker.
Graphs Chapter 12. Chapter 12: Graphs2 Chapter Objectives To become familiar with graph terminology and the different types of graphs To study a Graph.
Graphs Basic properties.
Graphs Upon completion you will be able to:
Graph Theory. undirected graph node: a, b, c, d, e, f edge: (a, b), (a, c), (b, c), (b, e), (c, d), (c, f), (d, e), (d, f), (e, f) subgraph.
Graphs. Contents Terminology Graphs as ADTs Applications of Graphs.
Graphs Chapter 28 © 2015 Pearson Education, Inc., Upper Saddle River, NJ. All rights reserved. Data Structures and Abstractions with Java, 4e Frank Carrano.
Graphs Definition: a graph is an abstract representation of a set of objects where some pairs of the objects are connected by links. The interconnected.
Chapter 05 Introduction to Graph And Search Algorithms.
Graph Concepts Illustrated Using The Leda Library Amanuel Lemma CS252 Algorithms.
Graph Theory Def: A graph is a set of vertices and edges G={V,E} Ex. V = {a,b,c,d,e} E = {ab,bd,ad,ed,ce,cd} Note: above is a purely mathematical definition.
1 GRAPH Learning Outcomes Students should be able to: Explain basic terminology of a graph Identify Euler and Hamiltonian cycle Represent graphs using.
DATA STRUCTURE Presented By: Mahmoud Rafeek Alfarra Using C# MINISTRY OF EDUCATION & HIGHER EDUCATION COLLEGE OF SCIENCE AND TECHNOLOGY KHANYOUNIS- PALESTINE.
Programming Abstractions Cynthia Lee CS106B. Upcoming Topics Graphs! 1.Basics  What are they? How do we represent them? 2.Theorems  What are some things.
Code: BCA302 Data Structures with C Prof. (Dr.) Monalisa Banerjee By.
Subject Four Graphs Data Structures. What is a graph? A data structure that consists of a set of nodes (vertices) and a set of edges that relate the nodes.
Basic Concepts Graphs For more notes and topics visit:
Grade 11 AP Mathematics Graph Theory
Agenda Lecture Content: Introduction to Graph Path and Cycle
Refresh and Get Ready for More
Graph Algorithm.
Graphs Chapter 13.
CS223 Advanced Data Structures and Algorithms
Chapter 9: Graphs Basic Concepts
Connectivity Section 10.4.
Walks, Paths, and Circuits
Graphs.
Chapter 14 Graphs © 2006 Pearson Addison-Wesley. All rights reserved.
Lecture 10: Graphs Graph Terminology Special Types of Graphs
Graphs G = (V, E) V are the vertices; E are the edges.
GRAPHS G=<V,E> Adjacent vertices Undirected graph
CHAPTER 15 Graph Theory.
Paths and Connectivity
Chapter 10 Graphs and Trees
Graph Vocabulary.
Graphs: Definitions How would you represent the following?
Chapter 9: Graphs Basic Concepts
GRAPHS.
For Friday Read chapter 9, sections 2-3 No homework
Presentation transcript:

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??? 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.

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.

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.

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.

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

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”.