Graph theory: basic concepts
|
|
- Harvey Turner
- 6 years ago
- Views:
Transcription
1 Graph theory: basic concepts Graphs and networks allow modelling many different decision problems Graphs permit to represent relationships among different kinds of entities: Cities connected by roads Computers connected in a network People linked by family relationships Two persons sharing a room Connections among electronic components Graphs are a formal tool to model problems as Find the shortest path between two cities Determine the cheapest (most effectie) way of connecting a set of computers in a communication network Assign a set of jobs to a set of machines Find the routes for a fleet of ehicle to supply a set of customer in the most effectie way
2 Undirected graph An undirected graph G=(V, E) is defined by a pair of finite sets: V={ 1,..., n } set of n nodes (ertices) of G E={e 1,..,e m } V V set of m non directed arcs (edges) of G Each edge of G corresponds to an unordered pair of nodes of G e k =( i, j ) Nodes may be associated with entities and an edge denotes a relationship between two of them (e.g., two connected computers) Edges can represent roads, paths, physical connections (water or gas supply pipelines, electrical lines) and nodes can represent junction points (e.g., crossroads)
3 Example of undirected graph G =(V, E) 1 e 2 2 e 6 e 1 e 3 e 5 3 e 7 e V = {,,, } E = { e, e, e, e, e, e e } , 5 (, ) e ( ) e = 1 = , , 2 7
4 Definitions An edge (,) is a loop Two nodes u, V are adjacent if it exists (u,) E u adjacent u not adjacent k k u h Not adjacent Two edges (u,),(,h) E are adjacent if they share a node An edge (u,) is defined by the pair of linked nodes A graph where more edges exist for a same pair of nodes is a multigraph u multigraph
5 Definitions (cont.) An edge connecting more than two nodes is an hyperedge Hyperedge (u,,k) u k In general a hyperedge is a subset of V Graphs including hyperedges are hypergraphs A graph without multiple edge, hyperedge and loop is a simple graph An edge f=(u,) E is incident on u and The node set N()={z V: z adjacent to } is the neighbourhood of in G u k s h N()={u,k,s,h}
6 Definitions (cont.) The set of edges δ()={e E: e incident on } is the star of in G u k e 1 e 2 δ() is the degree of node e 3 s h δ()={(u,),(k,),(,s),(,h)} or e 4 δ()={e 1, e 2, e 3, e 4 }
7 Subgraphs H=(W, F) is subgraph of G=(V,E) if W V and F E and such that if (u,) F then u, W 1 e e 2 2 e 3 e 6 e 1 e 5 3 e e 4 e 7 5 G=(V,E) 4 H=(W,F) subgraph of G
8 Subgraphs H=(W, F) is subgraph induced by W in G=(V, E) if W V and (u,) F implies that u, W and (u,) E 1 e e 2 2 e 1 e 3 e 5 e 6 3 e 1 e 3 e e 4 e 7 5 G=(V,E) 4 H=(W,F) subgraph of G induced by nodes in W
9 Subgraphs H=(W, F) is subgraph induced by F in G=(V,E) if (u,) F implies that (u,) E and u, W V 1 e e 2 2 e 1 e 3 e 5 e 6 3 e 3 e e 4 e 7 5 G=(V,E) 4 H=(W, F) subgraph of G induced by edge in F
10 Bipartite graph G=(V,E) is a bipartite graph if it exists a partition of V=V 1 V 2 such that: V 1 V 2 = e=(u,) E if u V 1 then V 2 otherwise if u V 2 then V 1 Bipartite graph V 1 V 2 Not Bipartite graph
11 Complete graph G=(V,E) is complete if it includes all possible edges, that is δ() =n-1 V where n= V Maximum number of edges for a non oriented complete graph n 2 = n( n 1) 2 Complete graph
12 Directed graph G=(V,A) directed graph is defined by a pair of finite sets: V={ 1,..., n } set of n nodes di G A={a 1,..,a m } V V set of m arcs of G where a j j=1,...,m is defined by an ordered pair of nodes In a directed graph a i =( k, h ) a j =( h, k ) a i, a j A 1 a 3 2 a1 a2 a 4 a 6 a 4 5 3
13 Directed graphs Arcs (directed links) are represented by arrows Tail u a Arc a=(u,) is incident on nodes u e : exiting from u and entering in Arcs are used when there is a direction in the relationship between nodes (e.g., one way road, direction of flow for a fluid) δ + ()={a A: a exiting from } set of arcs said forward star of δ - ()={a A: a entering in } set of arcs said backward star of Star of δ ()=δ + () δ - () δ + ()={(,s),(,h)} or δ + ()={a 3, a 4 } δ - ()={(u,),(k,)} or δ - ()={a 1, a 2 } u k a 1 a 2 Head a 3 a 4 s h
14 Directed graphs Definition of subgraph and induced subgraph are analogous to those for undirected graphs G=(V,A) directed graph is complete if it includes all the possible arcs, that is, δ + () = δ - () =n-1 V Maximum number of arcs for a directed complete graph n 2 = n( n 1) 2
15 Mixed graph G=(V,A E) is a mixed graph if the set of arcs includes both directed and undirected arcs Example: urban road networks are usually mixed graphs A complete (directed or undirected) graph is called clique Also complete subgraphs of a graph are denoted as cliques In a clique each node is adjacent to any other node in the clique Graph density: the ratio between the number of arcs and the maximum number of arcs m For undirected graphs D = n( n 1) / 2 0 D 1
16 Walks and Paths Gien an undirected graph G=(V, E) a walk in G is an ordered set of nodes W={ 0, 1,..., k } with k 1 ( 0 - k walk in G) if ( i 1, i ) E i=1,...,k Nodes 0 and k are the extremes of walk W Example W={ 0, 1, 2, 3, 4, 2 3, 4, 5 }
17 For directed G=(V, A) W={ 0, 1,..., k } with k 1 where ( i-1, i ) A i=1,...,k is an directed walk in G Length of W is the number of arcs in W Distance between two nodes u and is the minimum length of a walk from u to Example 1 a1 a2 a 3 a 4 2 a 6 a W={ 1, 4, 3, 2 } walk W ={ 1, 4, 1, 4, 2, 3 } directed walk
18 Gien an undirected G=(V, E), simple walk or path in G, P={ 0, 1,..., k } is a walk such that all included nodes and arcs are distinct Example P={ 0, 1, 2, 3, 4, 5 }
19 For a directed G=(V, A), a directed path in G, P={ 0, 1,..., k } is a directed walk isiting its nodes only once Example 1 a1 a2 a 3 a 4 2 a 6 a P={ 1, 4, 2, 3 } directed path An apparent property: If a (directed) walk between u and exists, then also a simple (directed) walk between u and exists
20 A walk W={ 0, 1,..., k, 0 } is said closed walk A simple closed walk is said cycle or circuit Example (closed walk) Example (cycles) directed
21 Connected graphs and connected components Gien G=(V, E) a node V is connected to a node z V if a (undirected or directed) walk exist between and z in G Example: mixed graph where connected to z but not connected to h z walk z h A node V is connected to itself (reflectiity) If V is connected to z V then z is connected to (symmetry) If V is connected to z V and z is connected to u V then is connected to u (transitiity)
22 The set of node V can be partitioned according to the property of connectionin subsets C i C i ={ V: is connected to z, z C i } The sub-graph induced by C i in G is said connected component of G If G includes a single connected component it is a connected graph ( V, z Vis connected to z) Example Non connected graph Connected components Connected graph
23 In a directed graph G=(V, A), V is strongly connected to z V if two directed walks exist in G, the first from to z and the second from z to Strong connectiity extends connectiity taking into account the direction of arcs Example and z strongly connected z and z not strongly connected z A directed graph can be partitioned in strongly connected components, i.e., subsets C i C i ={ V: is strongly connected to z, z C i } In a strongly connected component, each node is connected to any other node by a directed walk
24 A graph is strongly connected if it includes a single strongly connected component Example Strongly connected components Strongly connected graph
25 Graph theory: trees Definition A graph is acyclic if it does not contain any (directed or undirected) cycle Example Acyclic Not acyclic Lemmas: Any connected graph with n nodes contains at least n-1 arcs Any acyclic graph with n nodes includes at most n-1 arcs For any graph if two among the following properties hold, then the third property is implied : The graph is acyclic The graph is connected The graph contains n-1 arcs
26 Graph theory: trees Definizione A tree is an acyclic connected graph Any node of a tree with δ() =1 is said leaf Example Leaes Non acyclic connected graph Tree
27 Graph theory: trees Definition A forest is a not connected acyclic graph (each connected component is a tree) Example Connected components = trees Not connected acyclic graph = forest
28 Graph theory: trees Gien G=(V, E) the following statements are equialent: G is a tree Any pair of nodes in G is connected by a unique path G is acyclic and E = V -1 G is acyclic and connecting two not adjacent nodes a single cycle is closed in the graph G is connected and E = V -1 The number of edges in a forest with k connected components is n-k If in a tree V =n 2 then at least two leaes exist A Spanning Tree (ST) of G=(V, E) is a tree T=(W,F) withw=v and F E, i.e., a sub-graph of G Example A spanning tree A ST always exists for connected graphs
29 Hamiltonian and Eulerian paths and cycles Defintion Gien G=(V, E) a Hamiltonian path is a path isiting all the nodes in V exactly once A Hamiltonian circuit (also called tour) is a closed Hamiltonian path A graph is said Hamiltonian if it includes a Hamiltonian circuit Example Hamiltonian path Hamiltonian cycle 1 5
30 Hamiltonian and Eulerian paths and cycles Related problems: Determine if a graph includes a Hamiltonian path/cycle (hard problem) Gien a complete graph, whose arcs hae an associated length, determine the shortest Hamiltonian circuit: the well-known Traelling Salesman s Problem (TSP): A traelling salesman must isit n customers in n different cities starting and ending the tour at her/his city of residence In which sequence she/he must isit the customers if she/he wants to minimize the total distance coered?
31 Hamiltonian and Eulerian paths and cycles Problems associated with TSP Transportation problems: determine the best route for a ehicle or a fleet of ehicles in order to sere a demand located in a set of nodes of a graph representing a road network Many operational conditions: Capacity of ehicles and capacity required by demand Time windows (for arrial at nodes) Maximum tour duration (driers shifts) Pick-up and deliery serice Single or multiple depots Multiple ehicles with capacity = Vehicle Routing Problem (VRP) Example of VRP solution
32 Hamiltonian and Eulerian paths and cycles Why a complete graph is assumed for TSP? For TSP (or VRP) the arcs of the graph do not represent a road network but the possibility to trael from one node to another (through a path) The graph is complete since such possibility in transportation is always true The cost/distance associated with each arc = shortest path between any pair of nodes distances (costs) i h 3 2 (not complete) road network k 2 1 j Shortest paths distances (costs) i h k 2 1 Associated complete graph j
33 Hamiltonian and Eulerian paths and cycles Example: a scheduling problem that can be modelled as TSP Find the sequence for a set of manufacturing operations (jobs) on a machine so that it completes as soon as possible The processing times of the jobs are fixed A setup (e.g., cleaning) operation is needed between two successie jobs whose duration depends on the pair of jobs Example: a painting machine Blu painting setup Green painting Minimizing total duration = minimizing the total setup time Model: TSP on a complete graph Arc length = setup time
34 Hamiltonian and Eulerian paths and cycles Definition Gien G=(V, E) an Eulerian path is a path that isits all the arcs in E exactly once An Eulerian circuit is a closed Eulerian path A graph is Eulerian is it contains an Eulerian circuit Example
35 Hamiltonian and Eulerian paths and cycles The problem of finding an Eulerian path was defined by Euler in 1736 and presented at Saint Petersburg Academy as: In the city of Könisberg there is an island called Kneiphof around which flow the two branches of the Pregel Rier. There are seen bridges a, b, c, d, e, f, g which cross the two branches. The question is whether a person can choose a walk that leads to cross each bridge once but no more than once. Königsberg capital of Eastern Prussia Since the end of World War II Königsberg became Russian with the name of Kaliningrad
36 Hamiltonian and Eulerian paths and cycles A Pregel rier with its 7 bridges Pregel rier B C D A The model is a multigraph B C The problem: Is this graph Eulerian? D Euler found that there is no path with such property and deried the necessary and sufficient conditions for a undirected graph be Eulerian
37 Hamiltonian and Eulerian paths and cycles Theorem An undirected connected graph G=(V, E) is Eulerian if and only if eery node has een degree Theorem An undirected connected graph G=(V, E) contains an Eulerian path if eery node has een degree with the exception of two nodes s and t. Then the extremes of the Eulerian path are s and t. Exercise: which are the conditions for a directed graph to be Eulerian?
38 Hamiltonian and Eulerian paths and cycles The Chinese Postman Problem (CPP) CPP is the problem associated with Eulerian circuits as TSP is the one associated with Hamiltonian circuits : A postman has to delier mail to all the houses located on the streets of his neighbourhood. Its objectie is to complete its job coering the shortest distance, i.e., aoiding as much as possible to pass more than once along the same street. If the graph that model the map of the streets is Eulerian the postman does not need to pass more the once on each street Otherwise, the problem consists in finding how to complete the tour passing more then once only on the needed most conenient streets CPP each edge must be isited at least once so that the tour has the minimum length Examples of applications Mail deliery Urban waste collection (power, phone) lines inspection Transport of containers in logistic terminal
39 Incidence matrix of graphs It allows to represent the graph structure Two cases: undirected and directed graphs Facoltà di Ingegneria Undirected graphs Gien G=(V,E) undirected graph, A G =[a ij ], with i=1,...,n and j=1,...,m is the incidence matrix of G, where n= V and m= E, and such that 1 if e j incident on i aij = 0 otherwise Example e 2 1 e2 e3 e4 e e 1 e e 5 e A 3 G = e
40 Incidence matrix of graphs Gien the incidence matrix A G =[a ij ] the sum of non zero elements in a row gies the degree of the node associated with such row δ ( i ) = a ij Facoltà di Ingegneria The star of a node i can be defined as δ ( i ) = { e j E : aij = 1} Incidence matrices satisfy the necessary conditions for TUM (the elements must be 0, -1 or 1) A sufficient condition for an incidence matrix to be TUM is that the associated graph is bipartite A graph is bipartite if it does not contain odd cycles m j = e e 5 e 6 2 e 8 e6 e 3 8 e 7 4 e
41 Incidence matrix of graphs Directed graphs Facoltà di Ingegneria Gien G=(V,A) directed graph, A G =[a ij ], with i=1,...,n and j=1,...,m is the incidence matrix of G, where n= V and m= A, and such that a ij = Using the incidence matrix we can define: δ + ( i )={a j A: a ij =1} (forward start) δ - ( i )={a j A: a ij =-1} (backward star) e if i is head of a j (enters in if i is tail of a j (exits from otherwise 2 e 1 e 2 e 3 e 4 3 A G e 1 0 = e2 e3 e4 e5 0 0 i i 1 1 ) )
42 Adjacency matrix of graphs An alternatie representation of the graph structure Undirected graphs Facoltà di Ingegneria Gien G=(V,E) undirected graph, D G =[d ij ], with i=1,...,n and j=1,...,n is the adjacency matrix of G, where n= V and such that d ij = 1 if i is adjacent t o j 0 otherwise The matrix has n 2 elements and 2m non zero elements The sum of non zero elements in a row proides the degree of the node For undirected graphs the matrix is symmetric
43 Adjacency matrix of graphs Directed graphs Facoltà di Ingegneria Gien G=(V,A) directed graph, D G =[d ij ], with i=1,...,n and j=1,...,n is the adjacency matrix of G such that d ij = 1 if ( i, j ) A 0 otherwise The matrix is no more symmetric The sum of non zero elements in a row gies the number of arcs of the forward star of the associated node The sum of non zero elements in a column gies the number of arcs of the backward star of the associated node The number of not null elements of the matrix is m
Graph Theory CS/Math231 Discrete Mathematics Spring2015
1 Graphs Definition 1 A directed graph (or digraph) G is a pair (V, E), where V is a finite set and E is a binary relation on V. The set V is called the vertex set of G, and its elements are called vertices
More informationVarying Applications (examples)
Graph Theory Varying Applications (examples) Computer networks Distinguish between two chemical compounds with the same molecular formula but different structures Solve shortest path problems between cities
More informationSCHOOL OF ENGINEERING & BUILT ENVIRONMENT. Mathematics. An Introduction to Graph Theory
SCHOOL OF ENGINEERING & BUILT ENVIRONMENT Mathematics An Introduction to Graph Theory. Introduction. Definitions.. Vertices and Edges... The Handshaking Lemma.. Connected Graphs... Cut-Points and Bridges.
More informationMaterial handling and Transportation in Logistics. Paolo Detti Dipartimento di Ingegneria dell Informazione e Scienze Matematiche Università di Siena
Material handling and Transportation in Logistics Paolo Detti Dipartimento di Ingegneria dell Informazione e Scienze Matematiche Università di Siena Introduction to Graph Theory Graph Theory As Mathematical
More informationIntroduction III. Graphs. Motivations I. Introduction IV
Introduction I Graphs Computer Science & Engineering 235: Discrete Mathematics Christopher M. Bourke cbourke@cse.unl.edu Graph theory was introduced in the 18th century by Leonhard Euler via the Königsberg
More informationHow can we lay cable at minimum cost to make every telephone reachable from every other? What is the fastest route between two given cities?
1 Introduction Graph theory is one of the most in-demand (i.e. profitable) and heavily-studied areas of applied mathematics and theoretical computer science. May graph theory questions are applied in this
More informationAn Introduction to Graph Theory
An Introduction to Graph Theory CIS008-2 Logic and Foundations of Mathematics David Goodwin david.goodwin@perisic.com 12:00, Friday 17 th February 2012 Outline 1 Graphs 2 Paths and cycles 3 Graphs and
More informationIntroduction to Mathematical Programming IE406. Lecture 16. Dr. Ted Ralphs
Introduction to Mathematical Programming IE406 Lecture 16 Dr. Ted Ralphs IE406 Lecture 16 1 Reading for This Lecture Bertsimas 7.1-7.3 IE406 Lecture 16 2 Network Flow Problems Networks are used to model
More informationGRAPH THEORY AND LOGISTICS
GRAPH THEORY AND LOGISTICS Maja Fošner and Tomaž Kramberger University of Maribor Faculty of Logistics Mariborska cesta 2 3000 Celje Slovenia maja.fosner@uni-mb.si tomaz.kramberger@uni-mb.si Abstract This
More informationElements of Graph Theory
Elements of Graph Theory Quick review of Chapters 9.1 9.5, 9.7 (studied in Mt1348/2008) = all basic concepts must be known New topics we will mostly skip shortest paths (Chapter 9.6), as that was covered
More informationCrossing bridges. Crossing bridges Great Ideas in Theoretical Computer Science. Lecture 12: Graphs I: The Basics. Königsberg (Prussia)
15-251 Great Ideas in Theoretical Computer Science Lecture 12: Graphs I: The Basics February 22nd, 2018 Crossing bridges Königsberg (Prussia) Now Kaliningrad (Russia) Is there a way to walk through the
More informationChapter 11: Graphs and Trees. March 23, 2008
Chapter 11: Graphs and Trees March 23, 2008 Outline 1 11.1 Graphs: An Introduction 2 11.2 Paths and Circuits 3 11.3 Matrix Representations of Graphs 4 11.5 Trees Graphs: Basic Definitions Informally, a
More informationLecture 5: Graphs. Rajat Mittal. IIT Kanpur
Lecture : Graphs Rajat Mittal IIT Kanpur Combinatorial graphs provide a natural way to model connections between different objects. They are very useful in depicting communication networks, social networks
More informationGraph Theory. Part of Texas Counties.
Graph Theory Part of Texas Counties. We would like to visit each of the above counties, crossing each county only once, starting from Harris county. Is this possible? This problem can be modeled as a graph.
More informationOutline. Introduction. Representations of Graphs Graph Traversals. Applications. Definitions and Basic Terminologies
Graph Chapter 9 Outline Introduction Definitions and Basic Terminologies Representations of Graphs Graph Traversals Breadth first traversal Depth first traversal Applications Single source shortest path
More informationDiscrete Mathematics and Probability Theory Fall 2013 Vazirani Note 7
CS 70 Discrete Mathematics and Probability Theory Fall 2013 Vazirani Note 7 An Introduction to Graphs A few centuries ago, residents of the city of Königsberg, Prussia were interested in a certain problem.
More information8. The Postman Problems
8. The Postman Problems The Chinese postman problem (CPP) A postal carrier must pick up the mail at the post office, deliver the mail along blocks on the route, and finally return to the post office. To
More informationGraph Theory. ICT Theory Excerpt from various sources by Robert Pergl
Graph Theory ICT Theory Excerpt from various sources by Robert Pergl What can graphs model? Cost of wiring electronic components together. Shortest route between two cities. Finding the shortest distance
More informationLogic: The Big Picture. Axiomatizing Arithmetic. Tautologies and Valid Arguments. Graphs and Trees
Axiomatizing Arithmetic Logic: The Big Picture Suppose we restrict the domain to the natural numbers, and allow only the standard symbols of arithmetic (+,, =, >, 0, 1). Typical true formulas include:
More informationLecture 1: Examples, connectedness, paths and cycles
Lecture 1: Examples, connectedness, paths and cycles Anders Johansson 2011-10-22 lör Outline The course plan Examples and applications of graphs Relations The definition of graphs as relations Connectedness,
More informationGraphs: Definitions Trails, Paths, and Circuits Matrix Representations Isomorphisms. 11. Graphs and Trees 1. Aaron Tan. 30 October 3 November 2017
11. Graphs and Trees 1 Aaron Tan 30 October 3 November 2017 1 The origins of graph theory are humble, even frivolous. Whereas many branches of mathematics were motivated by fundamental problems of calculation,
More informationClassic Graph Theory Problems
Classic Graph Theory Problems Hiroki Sayama sayama@binghamton.edu The Origin Königsberg bridge problem Pregel River (Solved negatively by Euler in 176) Representation in a graph Can all the seven edges
More information0.0.1 Network Analysis
Graph Theory 0.0.1 Network Analysis Prototype Example: In Algonquian Park the rangers have set up snowmobile trails with various stops along the way. The system of trails is our Network. The main entrance
More informationCHAPTER 10 GRAPHS AND TREES. Alessandro Artale UniBZ - artale/z
CHAPTER 10 GRAPHS AND TREES Alessandro Artale UniBZ - http://www.inf.unibz.it/ artale/z SECTION 10.1 Graphs: Definitions and Basic Properties Copyright Cengage Learning. All rights reserved. Graphs: Definitions
More informationGraphs Definitions. Gunnar Gotshalks. GraphDefinitions 1
Graphs Definitions GraphDefinitions 1 Examples of Graphs Street maps» Vertices are the intersections» Edges are the streets Power line network» Vertices are the houses & power stations» Edges are the power
More informationIntroduction to Engineering Systems, ESD.00. Networks. Lecturers: Professor Joseph Sussman Dr. Afreen Siddiqi TA: Regina Clewlow
Introduction to Engineering Systems, ESD.00 Lecture 7 Networks Lecturers: Professor Joseph Sussman Dr. Afreen Siddiqi TA: Regina Clewlow The Bridges of Königsberg The town of Konigsberg in 18 th century
More informationGraph and Digraph Glossary
1 of 15 31.1.2004 14:45 Graph and Digraph Glossary A B C D E F G H I-J K L M N O P-Q R S T U V W-Z Acyclic Graph A graph is acyclic if it contains no cycles. Adjacency Matrix A 0-1 square matrix whose
More informationChapter 2 Graphs. 2.1 Definition of Graphs
Chapter 2 Graphs Abstract Graphs are discrete structures that consist of vertices and edges connecting some of these vertices. Graphs have many applications in Mathematics, Computer Science, Engineering,
More information6 ROUTING PROBLEMS VEHICLE ROUTING PROBLEMS. Vehicle Routing Problem, VRP:
6 ROUTING PROBLEMS VEHICLE ROUTING PROBLEMS Vehicle Routing Problem, VRP: Customers i=1,...,n with demands of a product must be served using a fleet of vehicles for the deliveries. The vehicles, with given
More informationDiscrete Mathematics for CS Spring 2008 David Wagner Note 13. An Introduction to Graphs
CS 70 Discrete Mathematics for CS Spring 2008 David Wagner Note 13 An Introduction to Graphs Formulating a simple, precise specification of a computational problem is often a prerequisite to writing a
More informationChapter 9 Graph Algorithms
Introduction graph theory useful in practice represent many real-life problems can be if not careful with data structures Chapter 9 Graph s 2 Definitions Definitions an undirected graph is a finite set
More informationIntroduction to Graph Theory
Introduction to Graph Theory Tandy Warnow January 20, 2017 Graphs Tandy Warnow Graphs A graph G = (V, E) is an object that contains a vertex set V and an edge set E. We also write V (G) to denote the vertex
More information6.2. Paths and Cycles
6.2. PATHS AND CYCLES 85 6.2. Paths and Cycles 6.2.1. Paths. A path from v 0 to v n of length n is a sequence of n+1 vertices (v k ) and n edges (e k ) of the form v 0, e 1, v 1, e 2, v 2,..., e n, v n,
More informationGraphs. Pseudograph: multiple edges and loops allowed
Graphs G = (V, E) V - set of vertices, E - set of edges Undirected graphs Simple graph: V - nonempty set of vertices, E - set of unordered pairs of distinct vertices (no multiple edges or loops) Multigraph:
More informationCHAPTER 10 GRAPHS AND TREES. Copyright Cengage Learning. All rights reserved.
CHAPTER 10 GRAPHS AND TREES Copyright Cengage Learning. All rights reserved. SECTION 10.1 Graphs: Definitions and Basic Properties Copyright Cengage Learning. All rights reserved. Graphs: Definitions and
More informationCS 311 Discrete Math for Computer Science Dr. William C. Bulko. Graphs
CS 311 Discrete Math for Computer Science Dr. William C. Bulko Graphs 2014 Definitions Definition: A graph G = (V,E) consists of a nonempty set V of vertices (or nodes) and a set E of edges. Each edge
More information8.2 Paths and Cycles
8.2 Paths and Cycles Degree a b c d e f Definition The degree of a vertex is the number of edges incident to it. A loop contributes 2 to the degree of the vertex. (G) is the maximum degree of G. δ(g) is
More informationChapter 9 Graph Algorithms
Chapter 9 Graph Algorithms 2 Introduction graph theory useful in practice represent many real-life problems can be if not careful with data structures 3 Definitions an undirected graph G = (V, E) is a
More informationMath 776 Graph Theory Lecture Note 1 Basic concepts
Math 776 Graph Theory Lecture Note 1 Basic concepts Lectured by Lincoln Lu Transcribed by Lincoln Lu Graph theory was founded by the great Swiss mathematician Leonhard Euler (1707-178) after he solved
More informationVertex-Edge Graphs. Vertex-Edge Graphs In the Georgia Performance Standards. Sarah Holliday Southern Polytechnic State University
Vertex-Edge Graphs Vertex-Edge Graphs In the Georgia Performance Standards Sarah Holliday Southern Polytechnic State University Math III MM3A7. Students will understand and apply matrix representations
More informationDiscrete Mathematics and Probability Theory Fall 2009 Satish Rao,David Tse Note 8
CS 70 Discrete Mathematics and Probability Theory Fall 2009 Satish Rao,David Tse Note 8 An Introduction to Graphs Formulating a simple, precise specification of a computational problem is often a prerequisite
More information11/22/2016. Chapter 9 Graph Algorithms. Introduction. Definitions. Definitions. Definitions. Definitions
Introduction Chapter 9 Graph Algorithms graph theory useful in practice represent many real-life problems can be slow if not careful with data structures 2 Definitions an undirected graph G = (V, E) is
More informationDS UNIT 4. Matoshri College of Engineering and Research Center Nasik Department of Computer Engineering Discrete Structutre UNIT - IV
Sr.No. Question Option A Option B Option C Option D 1 2 3 4 5 6 Class : S.E.Comp Which one of the following is the example of non linear data structure Let A be an adjacency matrix of a graph G. The ij
More informationChapter 9 Graph Algorithms
Chapter 9 Graph Algorithms 2 Introduction graph theory useful in practice represent many real-life problems can be slow if not careful with data structures 3 Definitions an undirected graph G = (V, E)
More informationCS473-Algorithms I. Lecture 13-A. Graphs. Cevdet Aykanat - Bilkent University Computer Engineering Department
CS473-Algorithms I Lecture 3-A Graphs Graphs A directed graph (or digraph) G is a pair (V, E), where V is a finite set, and E is a binary relation on V The set V: Vertex set of G The set E: Edge set of
More informationCS 4407 Algorithms Lecture 5: Graphs an Introduction
CS 4407 Algorithms Lecture 5: Graphs an Introduction Prof. Gregory Provan Department of Computer Science University College Cork 1 Outline Motivation Importance of graphs for algorithm design applications
More informationGraphs and Genetics. Outline. Computational Biology IST. Ana Teresa Freitas 2015/2016. Slides source: AED (MEEC/IST); Jones and Pevzner (book)
raphs and enetics Computational Biology IST Ana Teresa Freitas / Slides source: AED (MEEC/IST); Jones and Pevzner (book) Outline l Motivacion l Introduction to raph Theory l Eulerian & Hamiltonian Cycle
More informationIntroduction aux Systèmes Collaboratifs Multi-Agents
M1 EEAII - Découverte de la Recherche (ViRob) Introduction aux Systèmes Collaboratifs Multi-Agents UPJV, Département EEA Fabio MORBIDI Laboratoire MIS Équipe Perception et Robotique E-mail: fabio.morbidi@u-picardie.fr
More informationIntroduction to Graphs. Tecniche di Programmazione A.A. 2017/2018
Introduction to Graphs Tecniche di Programmazione Summary Definition: Graph Related Definitions Applications 2 Definition: Graph Introduction to Graphs Definition: Graph A graph is a collection of points
More information1. a graph G = (V (G), E(G)) consists of a set V (G) of vertices, and a set E(G) of edges (edges are pairs of elements of V (G))
10 Graphs 10.1 Graphs and Graph Models 1. a graph G = (V (G), E(G)) consists of a set V (G) of vertices, and a set E(G) of edges (edges are pairs of elements of V (G)) 2. an edge is present, say e = {u,
More informationGRAPHS, GRAPH MODELS, GRAPH TERMINOLOGY, AND SPECIAL TYPES OF GRAPHS
GRAPHS, GRAPH MODELS, GRAPH TERMINOLOGY, AND SPECIAL TYPES OF GRAPHS DR. ANDREW SCHWARTZ, PH.D. 10.1 Graphs and Graph Models (1) A graph G = (V, E) consists of V, a nonempty set of vertices (or nodes)
More informationAlgorithms: Graphs. Amotz Bar-Noy. Spring 2012 CUNY. Amotz Bar-Noy (CUNY) Graphs Spring / 95
Algorithms: Graphs Amotz Bar-Noy CUNY Spring 2012 Amotz Bar-Noy (CUNY) Graphs Spring 2012 1 / 95 Graphs Definition: A graph is a collection of edges and vertices. Each edge connects two vertices. Amotz
More informationAlgorithms. Graphs. Algorithms
Algorithms Graphs Algorithms Graphs Definition: A graph is a collection of edges and vertices. Each edge connects two vertices. Algorithms 1 Graphs Vertices: Nodes, points, computers, users, items,...
More informationKonigsberg Bridge Problem
Graphs Konigsberg Bridge Problem c C d g A Kneiphof e D a B b f c A C d e g D a b f B Euler s Graph Degree of a vertex: the number of edges incident to it Euler showed that there is a walk starting at
More informationTheory of Computing. Lecture 10 MAS 714 Hartmut Klauck
Theory of Computing Lecture 10 MAS 714 Hartmut Klauck Seven Bridges of Königsberg Can one take a walk that crosses each bridge exactly once? Seven Bridges of Königsberg Model as a graph Is there a path
More informationChapter 1 Graph Theory
Chapter Graph Theory - Representations of Graphs Graph, G=(V,E): It consists of the set V of vertices and the set E of edges. If each edge has its direction, the graph is called the directed graph (digraph).
More informationCharacterizing Graphs (3) Characterizing Graphs (1) Characterizing Graphs (2) Characterizing Graphs (4)
S-72.2420/T-79.5203 Basic Concepts 1 S-72.2420/T-79.5203 Basic Concepts 3 Characterizing Graphs (1) Characterizing Graphs (3) Characterizing a class G by a condition P means proving the equivalence G G
More informationGraphs (MTAT , 6 EAP) Lectures: Mon 14-16, hall 404 Exercises: Wed 14-16, hall 402
Graphs (MTAT.05.080, 6 EAP) Lectures: Mon 14-16, hall 404 Exercises: Wed 14-16, hall 402 homepage: http://courses.cs.ut.ee/2012/graafid (contains slides) For grade: Homework + three tests (during or after
More informationDieter Jungnickel (2008), Graphs, Networks and Algorithms, 3rd edition, which is available online via SpringerLink.
Lecture 1 First Steps in Graph Theory This lecture introduces Graph Theory, the main subject of the course, and includes some basic definitions as well as a number of standard examples. Reading: Some of
More informationCMSC 380. Graph Terminology and Representation
CMSC 380 Graph Terminology and Representation GRAPH BASICS 2 Basic Graph Definitions n A graph G = (V,E) consists of a finite set of vertices, V, and a finite set of edges, E. n Each edge is a pair (v,w)
More informationBIL694-Lecture 1: Introduction to Graphs
BIL694-Lecture 1: Introduction to Graphs Lecturer: Lale Özkahya Resources for the presentation: http://www.math.ucsd.edu/ gptesler/184a/calendar.html http://www.inf.ed.ac.uk/teaching/courses/dmmr/ Outline
More informationLet G = (V, E) be a graph. If u, v V, then u is adjacent to v if {u, v} E. We also use the notation u v to denote that u is adjacent to v.
Graph Adjacent Endpoint of an edge Incident Neighbors of a vertex Degree of a vertex Theorem Graph relation Order of a graph Size of a graph Maximum and minimum degree Let G = (V, E) be a graph. If u,
More informationDiscrete Mathematics
Discrete Mathematics Lecturer: Mgr. Tereza Kovářová, Ph.D. tereza.kovarova@vsb.cz Guarantor: doc. Mgr. Petr Kovář, Ph.D. Department of Applied Mathematics, VŠB Technical University of Ostrava About this
More informationOrdinary Differential Equation (ODE)
Ordinary Differential Equation (ODE) INTRODUCTION: Ordinary Differential Equations play an important role in different branches of science and technology In the practical field of application problems
More informationGraphs. Introduction To Graphs: Exercises. Definitions:
Graphs Eng.Jehad Aldahdooh Introduction To Graphs: Definitions: 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
More informationDiscrete mathematics II. - Graphs
Emil Vatai April 25, 2018 Basic definitions Definition of an undirected graph Definition (Undirected graph) An undirected graph or (just) a graph is a triplet G = (ϕ, E, V ), where V is the set of vertices,
More informationGraph Overview (1A) Young Won Lim 5/9/18
Copyright (c) 2015 2018 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published
More informationGraphs and trees come up everywhere. We can view the internet as a graph (in many ways) Web search views web pages as a graph
Graphs and Trees Graphs and trees come up everywhere. We can view the internet as a graph (in many ways) who is connected to whom Web search views web pages as a graph Who points to whom Niche graphs (Ecology):
More informationNetwork models and graph theory
Network models and graph theory G. Ferrari Trecate Dipartimento di Ingegneria Industriale e dell Informazione (DIII) Università degli Studi di Pavia Industrial Automation Ferrari Trecate (DII) Network
More informationGraph Theory S 1 I 2 I 1 S 2 I 1 I 2
Graph Theory S I I S S I I S Graphs Definition A graph G is a pair consisting of a vertex set V (G), and an edge set E(G) ( ) V (G). x and y are the endpoints of edge e = {x, y}. They are called adjacent
More informationGrade 7/8 Math Circles Graph Theory - Solutions October 13/14, 2015
Faculty of Mathematics Waterloo, Ontario N2L 3G1 Centre for Education in Mathematics and Computing Grade 7/8 Math Circles Graph Theory - Solutions October 13/14, 2015 The Seven Bridges of Königsberg In
More informationChapter 2: Graph Theory
Chapter 2: Graph Theory Graph Theory Introduction Applications of Graphs: Convenient representation/visualisation to many Mathematical, Engineering and Science Problems. Fundamental Data Structure in Computer
More informationMATH 363 Final Wednesday, April 28. Final exam. You may use lemmas and theorems that were proven in class and on assignments unless stated otherwise.
Final exam This is a closed book exam. No calculators are allowed. Unless stated otherwise, justify all your steps. You may use lemmas and theorems that were proven in class and on assignments unless stated
More informationIntroduction to Graphs
Introduction to Graphs Historical Motivation Seven Bridges of Königsberg Königsberg (now Kaliningrad, Russia) around 1735 Problem: Find a walk through the city that would cross each bridge once and only
More information1 Digraphs. Definition 1
1 Digraphs Definition 1 Adigraphordirected graphgisatriplecomprisedofavertex set V(G), edge set E(G), and a function assigning each edge an ordered pair of vertices (tail, head); these vertices together
More informationGraphs, graph algorithms (for image segmentation),... in progress
Graphs, graph algorithms (for image segmentation),... in progress Václav Hlaváč Czech Technical University in Prague Czech Institute of Informatics, Robotics and Cybernetics 66 36 Prague 6, Jugoslávských
More informationChapter 3: Paths and Cycles
Chapter 3: Paths and Cycles 5 Connectivity 1. Definitions: Walk: finite sequence of edges in which any two consecutive edges are adjacent or identical. (Initial vertex, Final vertex, length) Trail: walk
More informationSimple graph Complete graph K 7. Non- connected graph
A graph G consists of a pair (V; E), where V is the set of vertices and E the set of edges. We write V (G) for the vertices of G and E(G) for the edges of G. If no two edges have the same endpoints we
More information4. (a) Draw the Petersen graph. (b) Use Kuratowski s teorem to prove that the Petersen graph is non-planar.
UPPSALA UNIVERSITET Matematiska institutionen Anders Johansson Graph Theory Frist, KandMa, IT 010 10 1 Problem sheet 4 Exam questions Solve a subset of, say, four questions to the problem session on friday.
More informationGraph Theory. Connectivity, Coloring, Matching. Arjun Suresh 1. 1 GATE Overflow
Graph Theory Connectivity, Coloring, Matching Arjun Suresh 1 1 GATE Overflow GO Classroom, August 2018 Thanks to Subarna/Sukanya Das for wonderful figures Arjun, Suresh (GO) Graph Theory GATE 2019 1 /
More informationEuler and Hamilton paths. Jorge A. Cobb The University of Texas at Dallas
Euler and Hamilton paths Jorge A. Cobb The University of Texas at Dallas 1 Paths and the adjacency matrix The powers of the adjacency matrix A r (with normal, not boolean multiplication) contain the number
More informationFigure 2.1: A bipartite graph.
Matching problems The dance-class problem. A group of boys and girls, with just as many boys as girls, want to dance together; hence, they have to be matched in couples. Each boy prefers to dance with
More informationBasics of Graph Theory
Basics of Graph Theory 1 Basic notions A simple graph G = (V, E) consists of V, a nonempty set of vertices, and E, a set of unordered pairs of distinct elements of V called edges. Simple graphs have their
More informationCombinatorics Summary Sheet for Exam 1 Material 2019
Combinatorics Summary Sheet for Exam 1 Material 2019 1 Graphs Graph An ordered three-tuple (V, E, F ) where V is a set representing the vertices, E is a set representing the edges, and F is a function
More informationFoundations of Discrete Mathematics
Foundations of Discrete Mathematics Chapters 9 By Dr. Dalia M. Gil, Ph.D. Graphs Graphs are discrete structures consisting of vertices and edges that connect these vertices. Graphs A graph is a pair (V,
More informationGraph Theory. 1 Introduction to Graphs. Martin Stynes Department of Mathematics, UCC January 26, 2011
Graph Theory Martin Stynes Department of Mathematics, UCC email: m.stynes@ucc.ie January 26, 2011 1 Introduction to Graphs 1 A graph G = (V, E) is a non-empty set of nodes or vertices V and a (possibly
More informationNetwork Topology and Graph
Network Topology Network Topology and Graph EEE442 Computer Method in Power System Analysis Any lumped network obeys 3 basic laws KVL KCL linear algebraic constraints Ohm s law Anawach Sangswang Dept.
More informationWorksheet for the Final Exam - Part I. Graphs
Worksheet for the Final Exam - Part I. Graphs Date and Time: May 10 2012 Thursday 11:50AM~1:50PM Location: Eng 120 Start with the Self-Test Exercises (pp.816) in Prichard. 1. Give the adjacency matrix
More informationAll 13,509 cities in US with a population of at least 500 Reference:
Introduction to combinatorial optimization, modeling and complexity theory I. Introduction to combinatorial optimization and graph theory. Basics of Operations Research; Graph theory: basic notions 2.
More informationMath 778S Spectral Graph Theory Handout #2: Basic graph theory
Math 778S Spectral Graph Theory Handout #: Basic graph theory Graph theory was founded by the great Swiss mathematician Leonhard Euler (1707-178) after he solved the Königsberg Bridge problem: Is it possible
More information3 Euler Tours, Hamilton Cycles, and Their Applications
3 Euler Tours, Hamilton Cycles, and Their Applications 3.1 Euler Tours and Applications 3.1.1 Euler tours Carefully review the definition of (closed) walks, trails, and paths from Section 1... Definition
More informationGraph (1A) Young Won Lim 4/19/18
Graph (1A) Copyright (c) 2015 2018 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version
More informationDEFINITION OF GRAPH GRAPH THEORY GRAPHS ACCORDING TO THEIR VERTICES AND EDGES EXAMPLE GRAPHS ACCORDING TO THEIR VERTICES AND EDGES
DEFINITION OF GRAPH GRAPH THEORY Prepared by Engr. JP Timola Reference: Discrete Math by Kenneth H. Rosen A graph G = (V,E) consists of V, a nonempty set of vertices (or nodes) and E, a set of edges. Each
More informationOutline. 1 The matching problem. 2 The Chinese Postman Problem
Outline The matching problem Maximum-cardinality matchings in bipartite graphs Maximum-cardinality matchings in bipartite graphs: The augmenting path algorithm 2 Let G = (V, E) be an undirected graph.
More informationGraphs and Network Flows IE411. Lecture 21. Dr. Ted Ralphs
Graphs and Network Flows IE411 Lecture 21 Dr. Ted Ralphs IE411 Lecture 21 1 Combinatorial Optimization and Network Flows In general, most combinatorial optimization and integer programming problems are
More information2. CONNECTIVITY Connectivity
2. CONNECTIVITY 70 2. Connectivity 2.1. Connectivity. Definition 2.1.1. (1) A path in a graph G = (V, E) is a sequence of vertices v 0, v 1, v 2,..., v n such that {v i 1, v i } is an edge of G for i =
More informationFundamental Properties of Graphs
Chapter three In many real-life situations we need to know how robust a graph that represents a certain network is, how edges or vertices can be removed without completely destroying the overall connectivity,
More informationNumber Theory and Graph Theory
1 Number Theory and Graph Theory Chapter 7 Graph properties By A. Satyanarayana Reddy Department of Mathematics Shiv Nadar University Uttar Pradesh, India E-mail: satya8118@gmail.com 2 Module-2: Eulerian
More informationFurther Mathematics 2016 Module 2: NETWORKS AND DECISION MATHEMATICS Chapter 9 Undirected Graphs and Networks
Further Mathematics 2016 Module 2: NETWORKS AND DECISION MATHEMATICS Chapter 9 Undirected Graphs and Networks Key knowledge the conventions, terminology, properties and types of graphs; edge, face, loop,
More informationCourse Introduction / Review of Fundamentals of Graph Theory
Course Introduction / Review of Fundamentals of Graph Theory Hiroki Sayama sayama@binghamton.edu Rise of Network Science (From Barabasi 2010) 2 Network models Many discrete parts involved Classic mean-field
More information