Discrete Mathematics

Total Page:16

File Type:pdf, Size:1020Kb

Discrete Mathematics Discrete Mathematics (c) Marcin Sydow Graph Vertex Discrete Mathematics Degree Graphs Isomorphism Graph Matrices Graph as (c) Marcin Sydow Relation Paths and Cycles Connectedness Trees Contents Discrete Mathematics Introduction (c) Marcin Sydow Graph Digraph (directed graph) Graph Vertex Degree of a vertex Degree Graph isomorphism Isomorphism Graph Adjacency and Incidence Matrices Matrices Graphs vs Relations Graph as Relation Path and Cycle Paths and Cycles Connectedness Connectedness Weakly and strongly connected components Trees Tree Rooted tree Binary tree Introduction Discrete Mathematics (c) Marcin Sydow Graph The role of graphs: Vertex Degree extremely important in computer science and mathematics Isomorphism numerous important applications Graph Matrices modeling the concept of binary relation Graph as Graphs are extensively and intuitively to convey information in Relation visual form. Paths and Cycles Here we introduce basic mathematical view on graphs. Connectedness Trees Graph (the mathematical definition) Discrete Mathematics (c) Marcin Sydow Graph (undirected graph) is an ordered pair of sets: Graph G = (V ; E), where: Vertex Degree 1 Isomorphism V is the vertex set Graph E is the edge set Matrices Graph as each edge e = fv; wg in E is an unordered pair of Relation vertices from V , called the ends of the edge e. Paths and Cycles Connectedness Vertex can be also called node. Trees 1plural form: vertices Edges and vertices Discrete Mathematics (c) Marcin Sydow For an edge e = fv; wg 2 E we say: Graph the edge e connects the vertices v i w Vertex Degree the vertices v and w are neighbours or are adjacent in the Isomorphism graph G Graph Matrices the edge e is incident to the vertex v (or w). Graph as Relation a self-loop is an edge of the form (v; v). Paths and Cycles If V and E are empty G is the zero graph, if E is empty it is an Connectedness empty graph Trees Directed graph (digraph) (mathematical definition) Discrete Mathematics (c) Marcin Sydow Directed graph (digraph) is an ordered pair: G = (V ; E), Graph where: Vertex Degree V is the vertex set Isomorphism Graph E is the edge set (or arc set) Matrices Graph as each edge e = (v; w) in E is an ordered pair of vertices Relation from V , called the tail and head end of the edge e, Paths and Cycles respectively. Connectedness Example Trees Simple graphs, multigraphs and hypergraphs Discrete Mathematics (c) Marcin Sydow Graph Simple graph: a graph where there are no self-loops (edges or Vertex Degree arcs of the form (v; v)). Isomorphism If there are possible multiple edges or arcs between the same Graph Matrices pair of vertices we call it a multi-graph. Graph as Relation Notice: in a directed graph (v; w) is a different arc than (w; v) Paths and for v 6= w. Cycles Connectedness Trees Picture of a graph Discrete Mathematics (c) Marcin Sydow Graph A given graph can be depicted on a plane (or other Vertex Degree 2-dimensional surface) in multiple ways (example). Isomorphism A picture is only a visual form of representation of a graph. Graph Matrices It is necessary to distinguish between an abstract Graph as Relation (mathematical) concept of a graph and its picture (visual Paths and representation) Cycles Connectedness Trees Degree of a vertex Discrete Mathematics (c) Marcin Sydow Graph Degree of a vertex v denoted as deg(v) is the number of edges Vertex Degree (or arcs) incident with this vertex. Isomorphism (note: we assume that each self-loop (v; v) contributes 2 to the Graph Matrices degree of the vertex v) Graph as Relation If deg(v) = 0 we call it an isolated vertex. Paths and Example Cycles Connectedness Trees Proof: each edge contributes 2 to the sum of degrees. Corollary: sum of degrees is twice the number of edges Corollary: the number of vertices with odd degree must be even. Example Degree sum theorem (hand-shake theorem) Discrete Mathematics (c) Marcin Sydow The sum of degrees of all vertices in any graph is always even. Graph Vertex (why?) Degree Isomorphism Graph Matrices Graph as Relation Paths and Cycles Connectedness Trees Degree sum theorem (hand-shake theorem) Discrete Mathematics (c) Marcin Sydow The sum of degrees of all vertices in any graph is always even. Graph Vertex (why?) Degree Isomorphism Proof: each edge contributes 2 to the sum of degrees. Graph Matrices Corollary: sum of degrees is twice the number of edges Graph as Relation Corollary: the number of vertices with odd degree must be Paths and even. Cycles Connectedness Example Trees Degrees in directed graphs Discrete Mathematics (c) Marcin Sydow Graph Vertex In directed graphs: indegree of a vertex v (indeg(v)): number Degree of arcs that v is the head of Isomorphism Graph outdegree of a vertex v (outdeg(v)): number of arcs that v is Matrices the tail of Graph as Relation Example Paths and Cycles Connectedness Trees Degree sum theorem for digraphs Discrete Mathematics (c) Marcin Sydow Graph The sum of indegrees of all vertices is equal to the sum of Vertex Degree outdegrees of all vertices in any directed graph. Isomorphism Proof: each arc contributes 1 to the indegree sum and 1 to the Graph Matrices outdegree sum. Graph as Relation Corollary: sum of indegrees (outdegrees) is equal to the number Paths and of arcs in a digraph. Cycles Connectedness Trees Graph Isomorphism Discrete Mathematics (c) Marcin Sydow Two graphs G1(V1; E1), G2(V2; E2) are isomorphic , there exists a bijection f : V1 ! V2 so that: Graph Vertex v; w are connected by an edge (arc) in G1 , Degree f (v); f (w) are connected by an edge (arc) in G2. Isomorphism Graph The function f is called isomorphism between graphs G and Matrices 1 Graph as G2. Relation Example Paths and Cycles Interpretation: graphs are isomorphic if they are “the same” Connectedness from the point of view of the graph theory (they can have Trees different names of vertices or be differently depicted, etc.). Subgraph and induced graph Discrete Mathematics (c) Marcin Sydow Subgraph of graph G = (V ; E) is a graph H = (V 0; E 0) so that Graph V 0 ⊆ V and E 0 ⊆ E and any edge from E 0 has both its ends in Vertex 0 Degree V . Isomorphism Example Graph Matrices A subgraph of G induced by a set of vertices V 0 ⊆ V is a Graph as 0 0 Relation subgraph G of G whose vertex set is V whose edges (arcs) are 0 Paths and all edges (arcs) of G that have both ends in V . Cycles Connectedness Example Trees empty graph Nn (n vertices, no edges) (example) full graph Kn (a simple graph of n vertices and all possible edges (arcs)) (example) bi-partite graph (its set of vertices can be divided into two disjoint sets so that any edges (arcs) are only between the sets) (example) full bi-partite graph Km;n (a bipartite graph that has all possible edges (arcs)) path graph Pn (example) cyclic graph Cn (example) Some important graph families Discrete Mathematics (c) Marcin (all graphs below are simple graphs) Sydow Graph Vertex Degree Isomorphism Graph Matrices Graph as Relation Paths and Cycles Connectedness Trees full graph Kn (a simple graph of n vertices and all possible edges (arcs)) (example) bi-partite graph (its set of vertices can be divided into two disjoint sets so that any edges (arcs) are only between the sets) (example) full bi-partite graph Km;n (a bipartite graph that has all possible edges (arcs)) path graph Pn (example) cyclic graph Cn (example) Some important graph families Discrete Mathematics (c) Marcin (all graphs below are simple graphs) Sydow empty graph Nn (n vertices, no edges) (example) Graph Vertex Degree Isomorphism Graph Matrices Graph as Relation Paths and Cycles Connectedness Trees bi-partite graph (its set of vertices can be divided into two disjoint sets so that any edges (arcs) are only between the sets) (example) full bi-partite graph Km;n (a bipartite graph that has all possible edges (arcs)) path graph Pn (example) cyclic graph Cn (example) Some important graph families Discrete Mathematics (c) Marcin (all graphs below are simple graphs) Sydow empty graph Nn (n vertices, no edges) (example) Graph full graph Kn (a simple graph of n vertices and all possible Vertex Degree edges (arcs)) (example) Isomorphism Graph Matrices Graph as Relation Paths and Cycles Connectedness Trees full bi-partite graph Km;n (a bipartite graph that has all possible edges (arcs)) path graph Pn (example) cyclic graph Cn (example) Some important graph families Discrete Mathematics (c) Marcin (all graphs below are simple graphs) Sydow empty graph Nn (n vertices, no edges) (example) Graph full graph Kn (a simple graph of n vertices and all possible Vertex Degree edges (arcs)) (example) Isomorphism bi-partite graph (its set of vertices can be divided into two Graph Matrices disjoint sets so that any edges (arcs) are only between the Graph as sets) (example) Relation Paths and Cycles Connectedness Trees path graph Pn (example) cyclic graph Cn (example) Some important graph families Discrete Mathematics (c) Marcin (all graphs below are simple graphs) Sydow empty graph Nn (n vertices, no edges) (example) Graph full graph Kn (a simple graph of n vertices and all possible Vertex Degree edges (arcs)) (example) Isomorphism bi-partite graph (its set of vertices can be divided into two Graph Matrices disjoint sets so that any edges (arcs) are only between the Graph as sets) (example) Relation Paths and full bi-partite graph Km;n (a bipartite graph that has all Cycles possible edges (arcs)) Connectedness Trees cyclic graph Cn (example) Some important graph families Discrete Mathematics (c) Marcin (all graphs below are simple graphs) Sydow empty graph Nn (n vertices, no
Recommended publications
  • Directed Graph Algorithms
    Directed Graph Algorithms CSE 373 Data Structures Readings • Reading Chapter 13 › Sections 13.3 and 13.4 Digraphs 2 Topological Sort 142 322 143 321 Problem: Find an order in which all these courses can 326 be taken. 370 341 Example: 142 Æ 143 Æ 378 Æ 370 Æ 321 Æ 341 Æ 322 Æ 326 Æ 421 Æ 401 378 421 In order to take a course, you must 401 take all of its prerequisites first Digraphs 3 Topological Sort Given a digraph G = (V, E), find a linear ordering of its vertices such that: for any edge (v, w) in E, v precedes w in the ordering B C A F D E Digraphs 4 Topo sort – valid solution B C Any linear ordering in which A all the arrows go to the right F is a valid solution D E A B F C D E Note that F can go anywhere in this list because it is not connected. Also the solution is not unique. Digraphs 5 Topo sort – invalid solution B C A Any linear ordering in which an arrow goes to the left F is not a valid solution D E A B F C E D NO! Digraphs 6 Paths and Cycles • Given a digraph G = (V,E), a path is a sequence of vertices v1,v2, …,vk such that: ›(vi,vi+1) in E for 1 < i < k › path length = number of edges in the path › path cost = sum of costs of each edge • A path is a cycle if : › k > 1; v1 = vk •G is acyclic if it has no cycles.
    [Show full text]
  • Graph Varieties Axiomatized by Semimedial, Medial, and Some Other Groupoid Identities
    Discussiones Mathematicae General Algebra and Applications 40 (2020) 143–157 doi:10.7151/dmgaa.1344 GRAPH VARIETIES AXIOMATIZED BY SEMIMEDIAL, MEDIAL, AND SOME OTHER GROUPOID IDENTITIES Erkko Lehtonen Technische Universit¨at Dresden Institut f¨ur Algebra 01062 Dresden, Germany e-mail: [email protected] and Chaowat Manyuen Department of Mathematics, Faculty of Science Khon Kaen University Khon Kaen 40002, Thailand e-mail: [email protected] Abstract Directed graphs without multiple edges can be represented as algebras of type (2, 0), so-called graph algebras. A graph is said to satisfy an identity if the corresponding graph algebra does, and the set of all graphs satisfying a set of identities is called a graph variety. We describe the graph varieties axiomatized by certain groupoid identities (medial, semimedial, autodis- tributive, commutative, idempotent, unipotent, zeropotent, alternative). Keywords: graph algebra, groupoid, identities, semimediality, mediality. 2010 Mathematics Subject Classification: 05C25, 03C05. 1. Introduction Graph algebras were introduced by Shallon [10] in 1979 with the purpose of providing examples of nonfinitely based finite algebras. Let us briefly recall this concept. Given a directed graph G = (V, E) without multiple edges, the graph algebra associated with G is the algebra A(G) = (V ∪ {∞}, ◦, ∞) of type (2, 0), 144 E. Lehtonen and C. Manyuen where ∞ is an element not belonging to V and the binary operation ◦ is defined by the rule u, if (u, v) ∈ E, u ◦ v := (∞, otherwise, for all u, v ∈ V ∪ {∞}. We will denote the product u ◦ v simply by juxtaposition uv. Using this representation, we may view any algebraic property of a graph algebra as a property of the graph with which it is associated.
    [Show full text]
  • Directed Graphs Definition: an Directed Graph (Or Digraph) G = (V, E) Consists of a Nonempty Set V of Vertices (Or Nodes) and a Set E of Directed Edges (Or Arcs)
    Chapter 10 Chapter Summary Graphs and Graph Models Graph Terminology and Special Types of Graphs Representing Graphs and Graph Isomorphism Connectivity Euler and Hamiltonian Graphs Shortest-Path Problems (not currently included in overheads) Planar Graphs (not currently included in overheads) Graph Coloring (not currently included in overheads) Section 10.1 Section Summary Introduction to Graphs Graph Taxonomy Graph Models Graphs Definition: A graph G = (V, E) consists of a nonempty set V of vertices (or nodes) and a set E of edges. Each edge has either one or two vertices associated with it, called its endpoints. An edge is said to connect its endpoints. Example: a b This is a graph with four vertices and five edges. d c Remarks: The graphs we study here are unrelated to graphs of functions studied in Chapter 2. We have a lot of freedom when we draw a picture of a graph. All that matters is the connections made by the edges, not the particular geometry depicted. For example, the lengths of edges, whether edges cross, how vertices are depicted, and so on, do not matter A graph with an infinite vertex set is called an infinite graph. A graph with a finite vertex set is called a finite graph. We (following the text) restrict our attention to finite graphs. Some Terminology In a simple graph each edge connects two different vertices and no two edges connect the same pair of vertices. Multigraphs may have multiple edges connecting the same two vertices. When m different edges connect the vertices u and v, we say that {u,v} is an edge of multiplicity m.
    [Show full text]
  • Networkx: Network Analysis with Python
    NetworkX: Network Analysis with Python Salvatore Scellato Full tutorial presented at the XXX SunBelt Conference “NetworkX introduction: Hacking social networks using the Python programming language” by Aric Hagberg & Drew Conway Outline 1. Introduction to NetworkX 2. Getting started with Python and NetworkX 3. Basic network analysis 4. Writing your own code 5. You are ready for your project! 1. Introduction to NetworkX. Introduction to NetworkX - network analysis Vast amounts of network data are being generated and collected • Sociology: web pages, mobile phones, social networks • Technology: Internet routers, vehicular flows, power grids How can we analyze this networks? Introduction to NetworkX - Python awesomeness Introduction to NetworkX “Python package for the creation, manipulation and study of the structure, dynamics and functions of complex networks.” • Data structures for representing many types of networks, or graphs • Nodes can be any (hashable) Python object, edges can contain arbitrary data • Flexibility ideal for representing networks found in many different fields • Easy to install on multiple platforms • Online up-to-date documentation • First public release in April 2005 Introduction to NetworkX - design requirements • Tool to study the structure and dynamics of social, biological, and infrastructure networks • Ease-of-use and rapid development in a collaborative, multidisciplinary environment • Easy to learn, easy to teach • Open-source tool base that can easily grow in a multidisciplinary environment with non-expert users
    [Show full text]
  • A Logical Approach to Isomorphism Testing and Constraint Satisfaction
    A logical approach to Isomorphism Testing and Constraint Satisfaction Oleg Verbitsky Humboldt University of Berlin, Germany ESSLLI 2016, 1519 August 1/21 Part 8: k with : FO# k ≥ 3 Applications to Isomorphism Testing 2/21 Outline 1 Warm-up 2 Weisfeiler-Leman algorithm 3 Bounds for particular classes of graphs 4 References 3/21 Outline 1 Warm-up 2 Weisfeiler-Leman algorithm 3 Bounds for particular classes of graphs 4 References 4/21 Closure properties of denable graphs Denition G denotes the complement graph of G: V (G) = V (G) and uv 2 E(G) () uv2 = E(G). Exercise Prove that, if is denable in k , then is also denable G FO# G in k . FO# 5/21 Closure properties of denable graphs Denition G1 + G2 denotes the vertex-disjoint union of graphs G1 and G2. Exercise Let k ≥ 3. Suppose that connected graphs G1;:::;Gm are denable in k . Prove that is also denable FO# G1 + G2 + ::: + Gm in k . FO# Hint As an example, let k = 3 and suppose that G = 5A + 4B and H = 4A + 5B for some connected A and B such that W#(A; B) ≤ 3. In the rst round, Spoiler makes a counting move in G by marking all vertices in all A-components. Duplicator is forced to mark at least one vertex v in a B-component of H. Spoiler pebbles v, and Duplicator can only pebble some vertex u in an A-component of G. From now on, Spoiler plays in the components that contain u and v using his winning strategy for the game on A and B.
    [Show full text]
  • Adjacency and Incidence Matrices
    Adjacency and Incidence Matrices 1 / 10 The Incidence Matrix of a Graph Definition Let G = (V ; E) be a graph where V = f1; 2;:::; ng and E = fe1; e2;:::; emg. The incidence matrix of G is an n × m matrix B = (bik ), where each row corresponds to a vertex and each column corresponds to an edge such that if ek is an edge between i and j, then all elements of column k are 0 except bik = bjk = 1. 1 2 e 21 1 13 f 61 0 07 3 B = 6 7 g 40 1 05 4 0 0 1 2 / 10 The First Theorem of Graph Theory Theorem If G is a multigraph with no loops and m edges, the sum of the degrees of all the vertices of G is 2m. Corollary The number of odd vertices in a loopless multigraph is even. 3 / 10 Linear Algebra and Incidence Matrices of Graphs Recall that the rank of a matrix is the dimension of its row space. Proposition Let G be a connected graph with n vertices and let B be the incidence matrix of G. Then the rank of B is n − 1 if G is bipartite and n otherwise. Example 1 2 e 21 1 13 f 61 0 07 3 B = 6 7 g 40 1 05 4 0 0 1 4 / 10 Linear Algebra and Incidence Matrices of Graphs Recall that the rank of a matrix is the dimension of its row space. Proposition Let G be a connected graph with n vertices and let B be the incidence matrix of G.
    [Show full text]
  • Exclusive Graph Searching Lélia Blin, Janna Burman, Nicolas Nisse
    Exclusive Graph Searching Lélia Blin, Janna Burman, Nicolas Nisse To cite this version: Lélia Blin, Janna Burman, Nicolas Nisse. Exclusive Graph Searching. Algorithmica, Springer Verlag, 2017, 77 (3), pp.942-969. 10.1007/s00453-016-0124-0. hal-01266492 HAL Id: hal-01266492 https://hal.archives-ouvertes.fr/hal-01266492 Submitted on 2 Feb 2016 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. Exclusive Graph Searching∗ L´eliaBlin Sorbonne Universit´es, UPMC Univ Paris 06, CNRS, Universit´ed'Evry-Val-d'Essonne. LIP6 UMR 7606, 4 place Jussieu 75005, Paris, France [email protected] Janna Burman LRI, Universit´eParis Sud, CNRS, UMR-8623, France. [email protected] Nicolas Nisse Inria, France. Univ. Nice Sophia Antipolis, CNRS, I3S, UMR 7271, Sophia Antipolis, France. [email protected] February 2, 2016 Abstract This paper tackles the well known graph searching problem, where a team of searchers aims at capturing an intruder in a network, modeled as a graph. This problem has been mainly studied for its relationship with the pathwidth of graphs. All variants of this problem assume that any node can be simultaneously occupied by several searchers.
    [Show full text]
  • Graph Homomorphisms with Complex Values: a Dichotomy Theorem ∗
    SIAM J. COMPUT. c 2013 Society for Industrial and Applied Mathematics Vol. 42, No. 3, pp. 924–1029 GRAPH HOMOMORPHISMS WITH COMPLEX VALUES: A DICHOTOMY THEOREM ∗ † ‡ § JIN-YI CAI ,XICHEN, AND PINYAN LU Abstract. Each symmetric matrix A over C defines a graph homomorphism function ZA(·)on undirected graphs. The function ZA(·) is also called the partition function from statistical physics, and can encode many interesting graph properties, including counting vertex covers and k-colorings. We study the computational complexity of ZA(·) for arbitrary symmetric matrices A with algebraic complex values. Building on work by Dyer and Greenhill [Random Structures and Algorithms,17 (2000), pp. 260–289], Bulatov and Grohe [Theoretical Computer Science, 348 (2005), pp. 148–186], and especially the recent beautiful work by Goldberg et al. [SIAM J. Comput., 39 (2010), pp. 3336– 3402], we prove a complete dichotomy theorem for this problem. We show that ZA(·)iseither computable in polynomial-time or #P-hard, depending explicitly on the matrix A. We further prove that the tractability criterion on A is polynomial-time decidable. Key words. computational complexity, counting complexity, graph homomorphisms, partition functions AMS subject classifications. 68Q17, 68Q25, 68R05, 68R10, 05C31 DOI. 10.1137/110840194 1. Introduction. Graph homomorphism has been studied intensely over the years [28, 23, 13, 18, 4, 12, 21]. Given two graphs G and H, a graph homomorphism from G to H is a map f from the vertex set V (G)to V (H) such that, whenever (u, v)isanedgeinG,(f(u),f(v)) is an edge in H. The counting problem for graph homomorphism is to compute the number of homomorphisms from G to H.Forafixed graph H, this problem is also known as the #H-coloring problem.
    [Show full text]
  • Multilayer Networks
    Journal of Complex Networks (2014) 2, 203–271 doi:10.1093/comnet/cnu016 Advance Access publication on 14 July 2014 Multilayer networks Mikko Kivelä Oxford Centre for Industrial and Applied Mathematics, Mathematical Institute, University of Oxford, Oxford OX2 6GG, UK Alex Arenas Departament d’Enginyeria Informática i Matemátiques, Universitat Rovira I Virgili, 43007 Tarragona, Spain Marc Barthelemy Downloaded from Institut de Physique Théorique, CEA, CNRS-URA 2306, F-91191, Gif-sur-Yvette, France and Centre d’Analyse et de Mathématiques Sociales, EHESS, 190-198 avenue de France, 75244 Paris, France James P. Gleeson MACSI, Department of Mathematics & Statistics, University of Limerick, Limerick, Ireland http://comnet.oxfordjournals.org/ Yamir Moreno Institute for Biocomputation and Physics of Complex Systems (BIFI), University of Zaragoza, Zaragoza 50018, Spain and Department of Theoretical Physics, University of Zaragoza, Zaragoza 50009, Spain and Mason A. Porter† Oxford Centre for Industrial and Applied Mathematics, Mathematical Institute, University of Oxford, by guest on August 21, 2014 Oxford OX2 6GG, UK and CABDyN Complexity Centre, University of Oxford, Oxford OX1 1HP, UK †Corresponding author. Email: [email protected] Edited by: Ernesto Estrada [Received on 16 October 2013; accepted on 23 April 2014] In most natural and engineered systems, a set of entities interact with each other in complicated patterns that can encompass multiple types of relationships, change in time and include other types of complications. Such systems include multiple subsystems and layers of connectivity, and it is important to take such ‘multilayer’ features into account to try to improve our understanding of complex systems. Consequently, it is necessary to generalize ‘traditional’ network theory by developing (and validating) a framework and associated tools to study multilayer systems in a comprehensive fashion.
    [Show full text]
  • Structural Graph Theory Meets Algorithms: Covering And
    Structural Graph Theory Meets Algorithms: Covering and Connectivity Problems in Graphs Saeed Akhoondian Amiri Fakult¨atIV { Elektrotechnik und Informatik der Technischen Universit¨atBerlin zur Erlangung des akademischen Grades Doktor der Naturwissenschaften Dr. rer. nat. genehmigte Dissertation Promotionsausschuss: Vorsitzender: Prof. Dr. Rolf Niedermeier Gutachter: Prof. Dr. Stephan Kreutzer Gutachter: Prof. Dr. Marcin Pilipczuk Gutachter: Prof. Dr. Dimitrios Thilikos Tag der wissenschaftlichen Aussprache: 13. October 2017 Berlin 2017 2 This thesis is dedicated to my family, especially to my beautiful wife Atefe and my lovely son Shervin. 3 Contents Abstract iii Acknowledgementsv I. Introduction and Preliminaries1 1. Introduction2 1.0.1. General Techniques and Models......................3 1.1. Covering Problems.................................6 1.1.1. Covering Problems in Distributed Models: Case of Dominating Sets.6 1.1.2. Covering Problems in Directed Graphs: Finding Similar Patterns, the Case of Erd}os-P´osaproperty.......................9 1.2. Routing Problems in Directed Graphs...................... 11 1.2.1. Routing Problems............................. 11 1.2.2. Rerouting Problems............................ 12 1.3. Structure of the Thesis and Declaration of Authorship............. 14 2. Preliminaries and Notations 16 2.1. Basic Notations and Defnitions.......................... 16 2.1.1. Sets..................................... 16 2.1.2. Graphs................................... 16 2.2. Complexity Classes................................
    [Show full text]
  • Monte-Carlo Algorithms in Graph Isomorphism Testing
    Monte-Carlo algorithms in graph isomorphism testing L´aszl´oBabai∗ E¨otv¨osUniversity, Budapest, Hungary Universit´ede Montr´eal,Canada Abstract Abstract. We present an O(V 4 log V ) coin flipping algorithm to test vertex-colored graphs with bounded color multiplicities for color-preserving isomorphism. We are also able to generate uniformly distributed ran- dom automorphisms of such graphs. A more general result finds gener- ators for the intersection of cylindric subgroups of a direct product of groups in O(n7/2 log n) time, where n is the length of the input string. This result will be applied in another paper to find a polynomial time coin flipping algorithm to test isomorphism of graphs with bounded eigenvalue multiplicities. The most general result says that if AutX is accessible by a chain G0 ≥ · · · ≥ Gk = AutX of quickly recognizable groups such that the indices |Gi−1 : Gi| are small (but unknown), the order of |G0| is known and there is a fast way of generating uniformly distributed random members of G0 then a set of generators of AutX can be found by a fast algorithm. Applications of the main result im- prove the complexity of isomorphism testing for graphs with bounded valences to exp(n1/2+o(1)) and for distributive lattices to O(n6 log log n). ∗Apart from possible typos, this is a verbatim transcript of the author’s 1979 technical report, “Monte Carlo algorithms in graph isomorphism testing” (Universit´ede Montr´eal, D.M.S. No. 79-10), with two footnotes added to correct a typo and a glaring omission in the original.
    [Show full text]
  • MTH 304: General Topology Semester 2, 2017-2018
    MTH 304: General Topology Semester 2, 2017-2018 Dr. Prahlad Vaidyanathan Contents I. Continuous Functions3 1. First Definitions................................3 2. Open Sets...................................4 3. Continuity by Open Sets...........................6 II. Topological Spaces8 1. Definition and Examples...........................8 2. Metric Spaces................................. 11 3. Basis for a topology.............................. 16 4. The Product Topology on X × Y ...................... 18 Q 5. The Product Topology on Xα ....................... 20 6. Closed Sets.................................. 22 7. Continuous Functions............................. 27 8. The Quotient Topology............................ 30 III.Properties of Topological Spaces 36 1. The Hausdorff property............................ 36 2. Connectedness................................. 37 3. Path Connectedness............................. 41 4. Local Connectedness............................. 44 5. Compactness................................. 46 6. Compact Subsets of Rn ............................ 50 7. Continuous Functions on Compact Sets................... 52 8. Compactness in Metric Spaces........................ 56 9. Local Compactness.............................. 59 IV.Separation Axioms 62 1. Regular Spaces................................ 62 2. Normal Spaces................................ 64 3. Tietze's extension Theorem......................... 67 4. Urysohn Metrization Theorem........................ 71 5. Imbedding of Manifolds..........................
    [Show full text]