Graphs (MTAT , 4 AP / 6 ECTS) Lectures: Fri 12-14, hall 405 Exercises: Mon 14-16, hall 315 või N 12-14, aud. 405
|
|
- Timothy Hancock
- 5 years ago
- Views:
Transcription
1 Graphs (MTAT , 4 AP / 6 ECTS) Lectures: Fri 12-14, hall 405 Exercises: Mon 14-16, hall 315 või N 12-14, aud. 405 homepage: (contains slides) For grade: three tests (during or after semester)
2 Ã Ò Ö ½ Ø ÖÜ Ø Û Ð Ø Ø ÛÓÙÐ ÖÓ Ú ÖÝ Ö Ü¹ Ó ÓÒÒ Ö ØÙÖÒ ØÓ Ø ÒÒ Ò ØÐÝ
3 Ö ÔÖ ÒØ Ø ÓÒ Ó Ø Ã Ò Ö Ö ÔÖÓ ¹ Ö Ô Ð Ð Ñ ÙÐ ÖËÙ Û Ð ÑÔÓ Ð
4 Ø ÒÝ ÔÓ ÒØ Ò Ò Ð ØÖ Ð ÖÙ Ø Ø ÙÑ Ó ÙÖ¹ ÓÛ Ò ØÓÛ Ö Ø Ø ÔÓ ÒØ ÕÙ Ð ØÓ Ø ÙÑ Ó Ö ÒØ Ì Ö Ø ÙÑ Ó Ø Ð ØÖ Ð ÔÓØ ÒØ Ð Ö Ò ÖÙ Ø ÑÙ Ø Þ ÖÓº ÖÓÙÒ Ã Ö Ó Ð Û ½ µ ÙÖÖ ÒØ ÓÛ ÒÛ Ý ÖÓÑ Ø Ø ÔÓ Òغ
5 ÖØ ÙÖ ÝÐ Ý ½ µàóû Ñ ÒÝ ÓÑ Ö ÓÐ Ò Ë Ö Ò À ¾Ò ¾ Ö Ø Ö
6 ÖÑÝ ½ µàóû Ø Ø ÔÓ Ð ØÓ ØÖ Ò ÔÓÖØ ÍË ÖÓÑ ËÓÚ Ø ÍÒ ÓÒ ØÓ Ø ÖÒ ÙÖÓÔ ÙÔÔÐ Í Ò Ø Ö ÐÛ Ý Ý Ø Ñ ÙÔ ØÓ ½ ¼¼¼ ÓÖ ² ÙÐ Ö ÓÒ Ø Ñ º ØÓÒ
7 (Undirected) graph is a Î triple Eµ, where Î is the set of vertices (also denote Î µ); is the set of edges (also denote µ). E P Î µ is the incidency mapping. For all ¾, E µ must have 1 or 2 elements. In this course we only consider finite graphs.
8 ½ ¾ Ú ½ Ú ½ Ú ¾ ¾ Ú Example: Let Î Ú ½ Ú ¾ Ú Ú, ½ ¾ and E µ Ú ½ Ú ¾ Ú ¾ Ú Ú ¾ Ú Ú Ú Ú Ú Ú ¾ A drawing may illustrate a graph. But a graph itself is still the triple Î Eµ.
9 ½ Ú ½ Ú ¾ µ ¾ Ú ¾ Ú µ Ú ¾ Ú µ Ú Ú µ Ú Ú µ Ú ¾ Ú ¾ µ Ú ½ Ú ½ Ú ¾ ¾ Ú Directed graph consists of the sets of vertices Î and edges, and the incidency mapping E Î Î. The edges of a directed graph may also be called arcs. Example: let Î Ú ½ Ú ¾ Ú Ú, ½ ¾ and E µ
10 Let Î Eµ be a graph. Notations: If Ú ¾ E µ, then Ú and are incident. If there exists, such that E µ Ú ½ Ú ¾, then Ú ½ and ¾ are adjacent. Ú If Ú ½ Ú ¾, then Ú ½ and Ú ¾ are the endpoints of E µ. Ú Denote also ½ Ú¾. Let Î Eµ be a directed graph. Notations: If E µ Ú ½ Ú ¾ µ, then Ú ½ the end vertex of. is the start vertex and Ú ¾
11 Ú ½ ½ Ú ¾ ¾ ¾ is a multiple edge, if there exists ¼ ¾ Ò, such E µ E that µ. ¾ is a loop, if E µ ½. ¼ loop Ú multiple edges A simple graph is a graph without loops and multiple edges. Ú
12 ½ Ú ½ Ú ¾ µ ¾ Ú ¾ Ú µ Ú ¾ Ú µ Ú Ú µ In a directed simple graph, we may assume Î Î. To an edge ¾, where E µ Ú ½ Ú ¾ µ, corresponds Ú ½ Ú ¾ µ ¾ Î Î. Example: let Î Ú ½ Ú ¾ Ú Ú, ½ ¾ and E µ We may assume that Ú ½ Ú ¾ µ Ú ¾ Ú µ Ú ¾ Ú µ Ú Ú µ.
13 ½ ¾ In an undirected simple graph we may also assume Î. Î To an ¾ edge, E µ Ú where Ú ¾ ½, corresponds ½ Ú ¾ µ Ú ¾ Ú ½ µ Î Î. Ú Example: let Î Ú ½ Ú ¾ Ú Ú, ½ ¾ and E µ Ú ½ Ú ¾ Ú ¾ Ú Ú ¾ Ú Ú Ú We may assume that Ú ½ Ú ¾ µ Ú ¾ Ú ½ µ Ú ¾ Ú µ Ú Ú ¾ µ Ú ¾ Ú µ Ú Ú ¾ µ Ú Ú µ Ú Ú µ.
14 Úµ ¾ Ú ¾ E µ ¾ E µ Ú Ú ½ Ú Ú ¾ Ú The degree of a vertex Ú in the graph Î Eµ is the number of edges incident to it (the loops count twice). Denote Úµ. 1 5 ½ 3 3 ¾
15 ε Let be undirected simple graph. Î Let ½ Ú Ò. The adjacency matrix of is a Ò Ò matrix Ú A, where If Ú Ú µ ¾, then ½. If Ú Ú µ ¾, then ¼. The adjacency matrix is symmetric and its main diagonal contains zeroes. Example Ú ½ Ú ½ Ú ¾ ¾ Ú
16 Theorem. An undirected simple graph contains an even number of vertices of odd degree. Proof. ε. Count the ones in the adjacency matrix of Their number is ¾. Their number is È Ú¾Î Úµ. These two quantities are equal. Hence the sum of degrees of all vertices is even. The sum of integers is even if an even number of summands are odd. Similarly, any undirected graph contains an even number of vertices of odd degree.
17 ¾ E µ Ú½ ¾ Ú Ò ¾ E µ ¾ E µ ÚÒ Proof. Let Î Ú ½ Ú Ò. Consider the sets ¾ Ú ½ ¾ E µ ¾ Ú ¾ ¾ E µ ¾ E µ Ú¾... Each ¾ belongs to exactly two of those sets. Hence È Ú¾Î Úµ ¾, which is even.
18 È Úµ ھΠIn a directed graph Î Eµ we define for a vertex Ú Ú; its indegree the number of edges ending in Úµ outdegree Úµ the number of edges starting in Ú. Similar theorem: Úµ. È Ú¾Î
19 A walk in the graph ε (from vertex Ü to vertex Ý) is a sequence È Ü Ú ¼ ½ Ú ½ ¾ Ú ¾ Ú Ú ½ Ú Ý The number is the length of the walk È. Denote È. Let Ü È Ý denote that È is a walk from Ü to Ý. A path is a walk where all vertices are distinct (only Ú ¼ Ú and may coincide). A walk is closed if Ú ¼ Ú. A closed path is a cycle. A graph is connected if there is a walk between each two of its vertices. The distance Ù Úµ between vertices Ù Ú ¾ Î is the length of the shortest walk connecting them.
20 Ú Ú ½ Ú Ú ¾ Ú Ú Examples: Ú Walk: ½ Ú ¾ Ú Ú Ú ¾ Ú Ú Path: ½ Ú ¾ Ú Ú Closed Ú walk: ½ Ú ¾ Ú Ú ½ Ú Ú Ú ½ Ú Cycle: ½ Ú ¾ Ú Ú Ú ½ ½ Ú µ ¾, Ú ½ Ú ¾ µ ½, Ú ½ Ú ½ µ ¼. Ú
21 Theorem. If the degree of each vertex of a graph is at least ¾, then this graph contains a cycle. Proof. Loops and multiple edges are cycles. Assume ε is simple. Let Ú ½ ¾ Î. Exists Ú ¾ ¾ Î, such that Ú ½ Ú ¾. Exists Ú ¾ Î, such that Ú ½ Ú ¾ Ú. This path is simple. Let Ú ½ Ú ¾ Ú be a simple path. There exists Ú ½ ¾ Î, such that Ú ½ Ú ½ and Ú Ú ½. If Ú ½ Ú for some ¾ ½ ¾, then we have a cycle. Otherwise we have a longer simple path Ú ½ Ú ¾ Ú Ú ½. The length of a simple path is bounded by Î.
22 Theorem. A simple graph, where the degree of each vertex is at least ¾, has a cycle of length at least ½. Proof. Let Ü ¼ Ü ½ Ü Ð be an open path of maximal length in this graph. Ü ¼ Ü ½ Ü ¾ Ü All neighbours of Ü ¼ are located in this path. Let Ü be the neighbour of Ü ¼ with maximal index. Then. Ü ¼ Ü ½ Ü Ü ¼ is a cycle of length Ü Ü Ð ½ ½.
23 Ú½ Ú Ú¾ Ú Ú½ Ú¾ Ú Ú½ Ú¾ Ú The subgraph ε of a graph is a graph ¼ µ, where ¼ Î ¼ Î, ¼ and for all ¾ holds ¼ Î ¼. Denote ¼. E µ Î ¼ A µ subgraph is induced (by the Î set ), if the set ¼ Î ¼ is as large as possible, ¼ Î i.e. µ ¾ holds for ¼ E µ ¼ ¼ all ¾. Example: The connected components of a graph are its maximal connected subgraphs.
24 More notions: An edge of a graph is bridge if its removal increases the number of connected components. A vertex of a graph is cut vertex if its removal (together with its incident edges) increases the number of connected components.
25 A homomorphism from ½ Î ½ ½ µ to ¾ Î ¾ ¾ µ is a mapping Î ½ Î ¾, such that Ü Ý ¾ Î ½ are adjacent iff ܵ ݵ ¾ Î ¾ are adjacent. Example: Homomorphism is monomorphism, if it s injective. Homomorphism is isomorphism, if it s bijective. Graphs ½ and ¾ are isomorphic (denote ½ ¾ ), if there exists an isomorphism between them.
26 Usually we identify isomorphic graphs with each other. For example, let ½ Î ½ ½ µ and ¾ Î ¾ ¾ µ be ½ ¾ ½ Î ¾ ¼ ½ Î ½ Î ¼ ½ ½ µ graphs. We say that is a subgraph of, if there exist and ¾, such that ¼ ¼ ½ ¾. µ ½ Î ½ is an induced subgraph of ¾ iff there exists a monomorphism from ½ to ¾.
27 Graph isomorphism problem: Find whether two given simple graphs are isomorphic. The graphs are represented by e.g. their adjacency matrices. No polynomial-time algorithm for that task is known. In the following, let us see some polynomial-time verifiable necessary conditions for the isomorphism of two graphs.
28 Isomorphic graphs have equally many vertices and equally many edges. The degree sequence of the Ú graph Ú Ò µ ½ is the non-decreasing sequence of Ú values µ Ú Ò ½ µ. For example, the degree sequence of the graph is ½ ½ ¾ ¾ µ. Isomorphic graphs have the same degree sequences.
29 Ú ½ Ú ½ Ú ¾ ¾ Ú Ü ½ ¼ ¼ ½ Let be a square matrix and a unit matrix of the same dimensions. The characteristic polynomial (of the variable Ü) of the matrix is Ø Ü µ The characteristic polynomial of a simple graph is the characteristic polynomial of its adjacency matrix. E.g.: ¼ ½ Ü ½ ½ Ø ¼ ½ Ü ½ ¼ ½ ½ Ü Ü Ü ¾ ¾Ü ½
30 Two simple graphs are isomorphic iff the first adjacency matrix can be transformed to the second by permuting its rows and columns in the same way. Such permutation does not change the elements on the main diagonal. Such permutation contains an even number of swaps of rows or columns, hence it does not change the determinant. Isomorphic graphs have the same characteristic polynomial.
31 ½µ Ò Ò ¾ An edgeless graph is a graph without edges. A null graph Ò of vertices is denoted Ç by Ò Æ or Ò. A complete graph is a simple graph with an edge between each pair of vertices. A complete graph of Ò vertices is denoted by à Ò. Proposition. Graph Ã Ò has edges. Graph ε is bipartite, if Î can be partitioned to two sets Î ½ and Î ¾ (i.e. Î ½ Î ¾ Î and Î ½ Î ¾ ), such that the endpoints of any edge belong in different parts. (More generally: a graph is -partite if its vertices can be partitioned into parts such that all edges are between different parts.)
32 A bipartite simple graph with parts of vertices Î ½ and Î ¾ is complete bipartite if there is an edge between each Ú ½ ¾ Î ½ and Ú ¾ ¾ Î ¾. Let Ã Ñ Ò denote the complete bipartite graph with Î ½ Ñ and Î ¾ Ò. Proposition. Ã Ñ Ò has ÑÒ edges. Theorem. A graph is bipartite all its cycles are of even length. Proof µ. A cycle goes a number of times from the first part to the second and the same number of times from the second part to the first. Proof. ε Assume is connected. Otherwise consider each connected component separately. In the following we ll colour the vertices of black and white.
33 Pick a vertex Ú ¼ ¾ Î and colour it white. Let Ù be a coloured vertex that has uncoloured neighbours. Let Ú be one of such neighbours. Colour it with the opposite colour to Ù. Remember that the colour of Ù was used to choose the colour of Ú. Denote it Ú Ù. Repeat the previous paragraph, until one of the following happens there appear adjacent vertices Ü and Ý of the same colour; we run out of vertices to colour.
34 Ú ¼ Ú¼ If such vertices Ü and Ý appear then Ü Ý we have a cycle of odd length Ü Ú ¼ Ý Ü. Otherwise (we run out of vertices) the black vertices form one part and white vertices the other part of vertices of the bipartite graph.
35 Some history: 1735/6: Euler considered the Königsberg bridges question. 1750: Planar graphs: Euler s polyhedron formula. Proven 1794 by Legendre. Knight s tour problem (on chessboard): known hundreds of years. Solutions by Euler (1759), Vander- monde (1771). 1845: Kirchhoff s circuit laws. 1852: Earliest known mention of the four-color problem, in a letter from De Morgan to Hamilton. 1857: Icosian game (Hamilton). 1874: counting trees (Cayley). 1889: counting labeled trees.
36 1930: Necessary and sufficient criterions for planarity (Kuratowsky). 1976: Proof of the four-color theorem (Appel and Haken). Möbius s puzzle to his students ( ½ ¼): There once was a king with five sons. In his will he stated that after his death the sons should divide the kingdom into five regions, such that the boundary of each region should have a frontier line in common with each of the other four regions. Can the terms of the will be satisfied?
37 Tartu Akadeemiline Meeskoor võtab vastu uusi lauljaid. Proovid toimuvad T 18:30 ja N 18:30 endises EPA klubis (Veski 6, Kassitoomel). Uute lauljate vastuvõtt algab 7. septembrist. Eriti oodatud on tenorid.
Graphs (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 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 informationAdjacent: Two distinct vertices u, v are adjacent if there is an edge with ends u, v. In this case we let uv denote such an edge.
1 Graph Basics What is a graph? Graph: a graph G consists of a set of vertices, denoted V (G), a set of edges, denoted E(G), and a relation called incidence so that each edge is incident with either one
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 informationINTRODUCTION TO GRAPH THEORY. 1. Definitions
INTRODUCTION TO GRAPH THEORY D. JAKOBSON 1. Definitions A graph G consists of vertices {v 1, v 2,..., v n } and edges {e 1, e 2,..., e m } connecting pairs of vertices. An edge e = (uv) is incident 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 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 informationAssignment 4 Solutions of graph problems
Assignment 4 Solutions of graph problems 1. Let us assume that G is not a cycle. Consider the maximal path in the graph. Let the end points of the path be denoted as v 1, v k respectively. If either of
More informationLecture Notes on GRAPH THEORY Tero Harju
Lecture Notes on GRAPH THEORY Tero Harju Department of Mathematics University of Turku FIN-20014 Turku, Finland e-mail: harju@utu.fi 2007 Contents 1 Introduction 2 1.1 Graphs and their plane figures.........................................
More informationDiscrete Wiskunde II. Lecture 6: Planar Graphs
, 2009 Lecture 6: Planar Graphs University of Twente m.uetz@utwente.nl wwwhome.math.utwente.nl/~uetzm/dw/ Planar Graphs Given an undirected graph (or multigraph) G = (V, E). A planar embedding of G is
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 informationProposition 1. The edges of an even graph can be split (partitioned) into cycles, no two of which have an edge in common.
Math 3116 Dr. Franz Rothe June 5, 2012 08SUM\3116_2012t1.tex Name: Use the back pages for extra space 1 Solution of Test 1.1 Eulerian graphs Proposition 1. The edges of an even graph can be split (partitioned)
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 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 informationAssignment 1 Introduction to Graph Theory CO342
Assignment 1 Introduction to Graph Theory CO342 This assignment will be marked out of a total of thirty points, and is due on Thursday 18th May at 10am in class. Throughout the assignment, the graphs are
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 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 informationGraphs: Introduction. Ali Shokoufandeh, Department of Computer Science, Drexel University
Graphs: Introduction Ali Shokoufandeh, Department of Computer Science, Drexel University Overview of this talk Introduction: Notations and Definitions Graphs and Modeling Algorithmic Graph Theory and Combinatorial
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 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 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 informationRSA (Rivest Shamir Adleman) public key cryptosystem: Key generation: Pick two large prime Ô Õ ¾ numbers È.
RSA (Rivest Shamir Adleman) public key cryptosystem: Key generation: Pick two large prime Ô Õ ¾ numbers È. Let Ò Ô Õ. Pick ¾ ½ ³ Òµ ½ so, that ³ Òµµ ½. Let ½ ÑÓ ³ Òµµ. Public key: Ò µ. Secret key Ò µ.
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 informationProbabilistic analysis of algorithms: What s it good for?
Probabilistic analysis of algorithms: What s it good for? Conrado Martínez Univ. Politècnica de Catalunya, Spain February 2008 The goal Given some algorithm taking inputs from some set Á, we would like
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 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 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 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 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 informationMAS341 Graph Theory 2015 exam solutions
MAS4 Graph Theory 0 exam solutions Question (i)(a) Draw a graph with a vertex for each row and column of the framework; connect a row vertex to a column vertex if there is a brace where the row and column
More informationCHAPTER 2. Graphs. 1. Introduction to Graphs and Graph Isomorphism
CHAPTER 2 Graphs 1. Introduction to Graphs and Graph Isomorphism 1.1. The Graph Menagerie. Definition 1.1.1. A simple graph G = (V, E) consists of a set V of vertices and a set E of edges, represented
More informationAssignments are handed in on Tuesdays in even weeks. Deadlines are:
Tutorials at 2 3, 3 4 and 4 5 in M413b, on Tuesdays, in odd weeks. i.e. on the following dates. Tuesday the 28th January, 11th February, 25th February, 11th March, 25th March, 6th May. Assignments are
More informationScan Scheduling Specification and Analysis
Scan Scheduling Specification and Analysis Bruno Dutertre System Design Laboratory SRI International Menlo Park, CA 94025 May 24, 2000 This work was partially funded by DARPA/AFRL under BAE System subcontract
More informationBrief History. Graph Theory. What is a graph? Types of graphs Directed graph: a graph that has edges with specific directions
Brief History Graph Theory What is a graph? It all began in 1736 when Leonhard Euler gave a proof that not all seven bridges over the Pregolya River could all be walked over once and end up where you started.
More informationLecture 6: Graph Properties
Lecture 6: Graph Properties Rajat Mittal IIT Kanpur In this section, we will look at some of the combinatorial properties of graphs. Initially we will discuss independent sets. The bulk of the content
More informationRSA (Rivest Shamir Adleman) public key cryptosystem: Key generation: Pick two large prime Ô Õ ¾ numbers È.
RSA (Rivest Shamir Adleman) public key cryptosystem: Key generation: Pick two large prime Ô Õ ¾ numbers È. Let Ò Ô Õ. Pick ¾ ½ ³ Òµ ½ so, that ³ Òµµ ½. Let ½ ÑÓ ³ Òµµ. Public key: Ò µ. Secret key Ò µ.
More informationModels, Notation, Goals
Scope Ë ÕÙ Ò Ð Ò ÐÝ Ó ÝÒ Ñ ÑÓ Ð Ü Ô Ö Ñ Ö ² Ñ ¹Ú ÖÝ Ò Ú Ö Ð Ö ÒÙÑ Ö Ð ÔÓ Ö ÓÖ ÔÔÖÓÜ Ñ ÓÒ ß À ÓÖ Ð Ô Ö Ô Ú ß Ë ÑÙÐ ÓÒ Ñ Ó ß ËÑÓÓ Ò ² Ö Ò Ö Ò Ô Ö Ñ Ö ÑÔÐ ß Ã ÖÒ Ð Ñ Ó ÚÓÐÙ ÓÒ Ñ Ó ÓÑ Ò Ô Ö Ð Ð Ö Ò Ð ÓÖ Ñ
More informationDefinition 1.1. A matching M in a graph G is called maximal if there is no matching M in G so that M M.
1 Matchings Before, we defined a matching as a set of edges no two of which share an end in common. Suppose that we have a set of jobs and people and we want to match as many jobs to people as we can.
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 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 informationComputing optimal linear layouts of trees in linear time
Computing optimal linear layouts of trees in linear time Konstantin Skodinis University of Passau, 94030 Passau, Germany, e-mail: skodinis@fmi.uni-passau.de Abstract. We present a linear time algorithm
More informationLecture 3: Recap. Administrivia. Graph theory: Historical Motivation. COMP9020 Lecture 4 Session 2, 2017 Graphs and Trees
Administrivia Lecture 3: Recap Assignment 1 due 23:59 tomorrow. Quiz 4 up tonight, due 15:00 Thursday 31 August. Equivalence relations: (S), (R), (T) Total orders: (AS), (R), (T), (L) Partial orders: (AS),
More informationPlanarity. 1 Introduction. 2 Topological Results
Planarity 1 Introduction A notion of drawing a graph in the plane has led to some of the most deep results in graph theory. Vaguely speaking by a drawing or embedding of a graph G in the plane we mean
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 informationChapter 12 and 11.1 Planar graphs, regular polyhedra, and graph colorings
Chapter 12 and 11.1 Planar graphs, regular polyhedra, and graph colorings Prof. Tesler Math 184A Fall 2017 Prof. Tesler Ch. 12: Planar Graphs Math 184A / Fall 2017 1 / 45 12.1 12.2. Planar graphs Definition
More informationγ(ɛ) (a, b) (a, d) (d, a) (a, b) (c, d) (d, d) (e, e) (e, a) (e, e) (a) Draw a picture of G.
MAD 3105 Spring 2006 Solutions for Review for Test 2 1. Define a graph G with V (G) = {a, b, c, d, e}, E(G) = {r, s, t, u, v, w, x, y, z} and γ, the function defining the edges, is given by the table ɛ
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 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 informationMathematics and Statistics, Part A: Graph Theory Problem Sheet 1, lectures 1-4
1. Draw Mathematics and Statistics, Part A: Graph Theory Problem Sheet 1, lectures 1-4 (i) a simple graph. A simple graph has a non-empty vertex set and no duplicated edges. For example sketch G with V
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 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 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 informationExercise set 2 Solutions
Exercise set 2 Solutions Let H and H be the two components of T e and let F E(T ) consist of the edges of T with one endpoint in V (H), the other in V (H ) Since T is connected, F Furthermore, since T
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 22 Tuesday, April 10
CIS 160 - Spring 2018 (instructor Val Tannen) Lecture 22 Tuesday, April 10 GRAPH THEORY Directed Graphs Directed graphs (a.k.a. digraphs) are an important mathematical modeling tool in Computer Science,
More informationPart II. Graph Theory. Year
Part II Year 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2017 53 Paper 3, Section II 15H Define the Ramsey numbers R(s, t) for integers s, t 2. Show that R(s, t) exists for all s,
More informationLecture 4: Walks, Trails, Paths and Connectivity
Lecture 4: Walks, Trails, Paths and Connectivity Rosa Orellana Math 38 April 6, 2015 Graph Decompositions Def: A decomposition of a graph is a list of subgraphs such that each edge appears in exactly one
More informationLecture 4: Bipartite graphs and planarity
Lecture 4: Bipartite graphs and planarity Anders Johansson 2011-10-22 lör Outline Bipartite graphs A graph G is bipartite with bipartition V1, V2 if V = V1 V2 and all edges ij E has one end in V1 and V2.
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 informationGraph theory. Po-Shen Loh. June We begin by collecting some basic facts which can be proved via bare-hands techniques.
Graph theory Po-Shen Loh June 013 1 Basic results We begin by collecting some basic facts which can be proved via bare-hands techniques. 1. The sum of all of the degrees is equal to twice the number of
More informationMatching Algorithms. Proof. If a bipartite graph has a perfect matching, then it is easy to see that the right hand side is a necessary condition.
18.433 Combinatorial Optimization Matching Algorithms September 9,14,16 Lecturer: Santosh Vempala Given a graph G = (V, E), a matching M is a set of edges with the property that no two of the edges have
More informationGraph Theory: Introduction
Graph Theory: Introduction Pallab Dasgupta, Professor, Dept. of Computer Sc. and Engineering, IIT Kharagpur pallab@cse.iitkgp.ernet.in Resources Copies of slides available at: http://www.facweb.iitkgp.ernet.in/~pallab
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 informationIntroduction to Graphs
Introduction to Graphs Slides by Lap Chi Lau The Chinese University of Hong Kong This Lecture In this part we will study some basic graph theory. Graph is a useful concept to model many problems in computer
More informationChapter 4. Relations & Graphs. 4.1 Relations. Exercises For each of the relations specified below:
Chapter 4 Relations & Graphs 4.1 Relations Definition: Let A and B be sets. A relation from A to B is a subset of A B. When we have a relation from A to A we often call it a relation on A. When we have
More informationK 4,4 e Has No Finite Planar Cover
K 4,4 e Has No Finite Planar Cover Petr Hliněný Dept. of Applied Mathematics, Charles University, Malostr. nám. 25, 118 00 Praha 1, Czech republic (E-mail: hlineny@kam.ms.mff.cuni.cz) February 9, 2005
More informationSFU CMPT Lecture: Week 8
SFU CMPT-307 2008-2 1 Lecture: Week 8 SFU CMPT-307 2008-2 Lecture: Week 8 Ján Maňuch E-mail: jmanuch@sfu.ca Lecture on June 24, 2008, 5.30pm-8.20pm SFU CMPT-307 2008-2 2 Lecture: Week 8 Universal hashing
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 informationPlanar graphs. Chapter 8
Chapter 8 Planar graphs Definition 8.1. A graph is called planar if it can be drawn in the plane so that edges intersect only at vertices to which they are incident. Example 8.2. Different representations
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 informationMATH 350 GRAPH THEORY & COMBINATORICS. Contents
MATH 350 GRAPH THEORY & COMBINATORICS PROF. SERGEY NORIN, FALL 2013 Contents 1. Basic definitions 1 2. Connectivity 2 3. Trees 3 4. Spanning Trees 3 5. Shortest paths 4 6. Eulerian & Hamiltonian cycles
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 informationMath 3012 Applied Combinatorics Lecture 12
September 29, 2015 Math 3012 Applied Combinatorics Lecture 12 William T. Trotter trotter@math.gatech.edu Planar Graphs Definition A graph G is planar if it can be drawn in the plane with no edge crossings.
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 informationLecture Notes on Graph Theory
Lecture Notes on Graph Theory Vadim Lozin 1 Introductory concepts A graph G = (V, E) consists of two finite sets V and E. The elements of V are called the vertices and the elements of E the edges of G.
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 informationMath.3336: Discrete Mathematics. Chapter 10 Graph Theory
Math.3336: Discrete Mathematics Chapter 10 Graph Theory Instructor: Dr. Blerina Xhabli Department of Mathematics, University of Houston https://www.math.uh.edu/ blerina Email: blerina@math.uh.edu Fall
More informationCS6702 GRAPH THEORY AND APPLICATIONS QUESTION BANK
CS6702 GRAPH THEORY AND APPLICATIONS 2 MARKS QUESTIONS AND ANSWERS 1 UNIT I INTRODUCTION CS6702 GRAPH THEORY AND APPLICATIONS QUESTION BANK 1. Define Graph. 2. Define Simple graph. 3. Write few problems
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 informationTrees. 3. (Minimally Connected) G is connected and deleting any of its edges gives rise to a disconnected graph.
Trees 1 Introduction Trees are very special kind of (undirected) graphs. Formally speaking, a tree is a connected graph that is acyclic. 1 This definition has some drawbacks: given a graph it is not trivial
More informationGraph Traversal. 1 Breadth First Search. Correctness. find all nodes reachable from some source node s
1 Graph Traversal 1 Breadth First Search visit all nodes and edges in a graph systematically gathering global information find all nodes reachable from some source node s Prove this by giving a minimum
More informationTWO CONTRIBUTIONS OF EULER
TWO CONTRIBUTIONS OF EULER SIEMION FAJTLOWICZ. MATH 4315 Eulerian Tours. Although some mathematical problems which now can be thought of as graph-theoretical, go back to the times of Euclid, the invention
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 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 informationMajority and Friendship Paradoxes
Majority and Friendship Paradoxes Majority Paradox Example: Small town is considering a bond initiative in an upcoming election. Some residents are in favor, some are against. Consider a poll asking the
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 informationMatching and Planarity
Matching and Planarity Po-Shen Loh June 010 1 Warm-up 1. (Bondy 1.5.9.) There are n points in the plane such that every pair of points has distance 1. Show that there are at most n (unordered) pairs of
More informationWUCT121. Discrete Mathematics. Graphs
WUCT121 Discrete Mathematics Graphs WUCT121 Graphs 1 Section 1. Graphs 1.1. Introduction Graphs are used in many fields that require analysis of routes between locations. These areas include communications,
More informationBasic Combinatorics. Math 40210, Section 01 Fall Homework 4 Solutions
Basic Combinatorics Math 40210, Section 01 Fall 2012 Homework 4 Solutions 1.4.2 2: One possible implementation: Start with abcgfjiea From edge cd build, using previously unmarked edges: cdhlponminjkghc
More informationArtificial Intelligence
Artificial Intelligence Graph theory G. Guérard Department of Nouvelles Energies Ecole Supérieur d Ingénieurs Léonard de Vinci Lecture 1 GG A.I. 1/37 Outline 1 Graph theory Undirected and directed graphs
More informationInstant Insanity Instructor s Guide Make-it and Take-it Kit for AMTNYS 2006
Instant Insanity Instructor s Guide Make-it and Take-it Kit for AMTNYS 2006 THE KIT: This kit contains materials for two Instant Insanity games, a student activity sheet with answer key and this instructor
More informationA graph is finite if its vertex set and edge set are finite. We call a graph with just one vertex trivial and all other graphs nontrivial.
2301-670 Graph theory 1.1 What is a graph? 1 st semester 2550 1 1.1. What is a graph? 1.1.2. Definition. A graph G is a triple (V(G), E(G), ψ G ) consisting of V(G) of vertices, a set E(G), disjoint from
More informationThis file contains an excerpt from the character code tables and list of character names for The Unicode Standard, Version 3.0.
Range: This file contains an excerpt from the character code tables and list of character names for The Unicode Standard, Version.. isclaimer The shapes of the reference glyphs used in these code charts
More informationModule 2: NETWORKS AND DECISION MATHEMATICS
Further Mathematics 2017 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 informationAn Introduction to Graph Theory
An Introduction to Graph Theory Evelyne Smith-Roberge University of Waterloo March 22, 2017 What is a graph? Definition A graph G is: a set V (G) of objects called vertices together with: a set E(G), of
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 information14 More Graphs: Euler Tours and Hamilton Cycles
14 More Graphs: Euler Tours and Hamilton Cycles 14.1 Degrees The degree of a vertex is the number of edges coming out of it. The following is sometimes called the First Theorem of Graph Theory : Lemma
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 informationv V Question: How many edges are there in a graph with 10 vertices each of degree 6?
ECS20 Handout Graphs and Trees March 4, 2015 (updated 3/9) Notion of a graph 1. A graph G = (V,E) consists of V, a nonempty set of vertices (or nodes) and E, a set of pairs of elements of V called edges.
More informationGraphs and Isomorphisms
Graphs and Isomorphisms Discrete Structures (CS 173) Backyards of Old Houses in Antwerp in the Snow Van Gogh Madhusudan Parthasarathy, University of Illinois Proof techniques: Direct Contrapositive Disproving
More information