DOCSLIB.ORG

Graphs and Their Coverings

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Graphs and Their Coverings GRAPHS AND THEIR COVERINGS Jin Ho Kwak Department of Mathematics, POSTECH, Pohang, 790{784 Korea [email protected] Roman Nedela Matej Bel University, Banska Bystrica, Slovakia Mathematical Institute, Slovak Academy of Sciences, Banska Bystrica, Slovakia [email protected] This work is supported by Com2MaC-KOSEF, Korea. Preface Combinatorial treatment of graph coverings had its primary incentive in the solution of Heawood's Map Colour Problem due to Ringel, Youngs and others [Ri74]. That coverings underlie the techniques that led to the eventual solution of the problem was recognized by Alpert and Gross [GA74]. These ideas further crystalized in 1974 in the work of Gross [Gr74] where voltage graphs were introduced as a means of a purely combinatorial description of regular graph coverings. In paral- lel, the very same idea appeared in Biggs' monograph [Bi74]. Much of the theory of combinatorial graph coverings in its own right was subse- quently developed by Gross and Tucker in the seventies. We refer the reader to [GT87, Wh84] and the references therein. The theory was extended to combinatorial graph bundles introduced by Pisanski and Vrabec [PV82] in the eighties. After two decades, since the book of Gross and Tucker [GT87] was published, it remains the most popular textbook as well as the reference book covering the topic. The authors of the presented monograph have several ambitions. Firstly, following the ideas in [MNS00] to establish and extend the combinatorial theory of graph coverings and voltage assignments onto a more general class of graphs which include edges with free ends (called semiedges). The new concept of a graph proved to be useful in applica- tions as well as in theoretical considerations. Some of the applications are shown in the book. From the theoretical point of view, graphs with semiedges arise as quotients of standard graphs by groups of automor- phisms which are semiregular on vertices and darts (arcs) but may ¯x edges. They may be viewed as 1-dimensional analogues of 2- and 3- dimensional orbifolds. The fruitful concept of an orbifold comes from studies of geometry of n-manifolds. Orbifolds and related concepts are implicitly included in the work of pioneers such as Henri Poincare, or Paul KÄobe. The ¯rst formal de¯nition of an orbifold-like object was i ii given by Ichiro Satake in 1956 in the context of Riemannian geome- try. William Thurston, later in the mid 1970s de¯ned and named the more general notion of orbifold as part of his study of hyperbolic struc- tures. It is not a surprise that the concept of graphs with semiedges was discovered in context of theoretical physics, as well (see [GK98] for instance). Secondly, following the ideas in [GS93] and in the subsequent papers [MNS00, Ma98, Sir01, Ma02, MMP04, MP06] we develop and organize a material on the combinatorial treatment of the lifting automorphism problem - a central problem considered in this book. The study of the automorphism lifting problem in the context of regular coverings of graphs had its main motivation in constructing in¯nite families of highly transitive graphs. The ¯rst notable contribution along these lines ap- peared, incidentally, in 1974 in Biggs' monograph [Bi74] and in a paper of Djokovi¶c[Dj74]. Whereas Biggs gave a combinatorial su±cient con- dition for a lifted group to be a split extension, Djokovi¶cfound a crite- rion, in terms of the fundamental group, for a group of automorphisms to lift at all. A decade later, several di®erent sources added further motivations for studying the lifting problem. These include: counting isomorphism classes of coverings and, more generally, graph bundles, as considered by Hofmeister [Ho91] and Kwak and Lee [KL90, KL92]; constructions of regular maps on surfaces based on covering space tech- niques due to Archdeacon, Gvozdjak, Nedela, Richter, Sir¶a·n,· Skoviera· and Surowski [ARSS94, AGJ97, GS93, NS96, NS97, Su88]; and con- struction of transitive graphs with prescribed degree of symmetry, for instance by Du, Malni·c,Nedela, Maru·si·c,Scapellato, Seifter, Tro¯- mov and Waller [DMW> 06, MM93, MMS> 06, MS93, ST97]. Lifting and/or projecting techniques play a prominent role also in the study of imprimitive graphs, cf. Gardiner and Praeger [GP95] among others. The lifting problem in terms of voltages in the context of general topo- logical spaces was considered by Malni·c[Ma98]. Venkatesh [Ve> 06] obtained structural results which re¯ne the work of Biggs [Bi74, Bi84] and Djokovi¶c[Dj74] on lifting groups. Recently, many original contribu- tions on the topic was published, both solving particular problems and developing pieces of theory. However, there is no monograph covering (more or less completely) fundamentals of the theory. The topic is omit- ted in the book by Gross and Tucker and in other related monographs iii in topological graph theory. So far, the most complete contribution to the theory was done in the thesis of A. Malni·c[Ma96], some parts are covered in the paper [MNS00]. The study of the lifting problem within the combinatorial framework was of course preceded by that in the topological setting. We refer the reader to the work of Armstrong, Birman, Hilden, MacBeath and Zieschang [Ar92, BH72, Mac61, Zi73] and many others. Finally, it is our ambition to shift by one dimension up, namely, to study 2-cell embeddings of graphs into surfaces. The corresponding 2- dimensional objects are called maps and they present a central object of topological graph theory. For the purpose of this future project, it was necessary ¯rst to rebuilt some classical parts of graph theory and the presented monograph can be used as preliminary material for investigation of maps and their symmetries. The book contains three chapters. First one introduce basic con- cepts such as graphs and groups acting on graphs. Some useful concepts and statements from permutation groups are briefly mentioned. The second chapter is central. There, a theory of graph coverings is devel- oped. It includes action of the fundamental group, classical approach to the theory of graph coverings and the associated theory of voltage spaces with some applications. The lifting automorphism problem is studied in detail, theory of voltage spaces us uni¯ed and generalized to graphs with semiedges. This way `a gap' in the familiar and popular Gross and Tucker's book `Topological graph theory' is ¯lled in. In the ¯nal chapter the lifting and covering techniques are used to approach some problems of classical graph theory. In particular, a material on flows on graphs and enumeration of graph coverings is included. The book can be used as a material for a course on graph coverings as well as it could be of interest of specialist interesting in the topic. We would like to take this opportunity to thank all people who give us valuable comments and suggestions for revising this book, including many students. Finally we are grateful to Korea Science and Engineering Founda- tion (KOSEF) in Korea for supporting us during preparation of this book. Jin Ho Kwak iv Roman Nedela E-mail: [email protected] [email protected] July 2005, in Pohang, Korea Contents Preface i 1 Graphs and Groups 1 1.1 Introduction . 1 1.2 Graphs and their fundamental groups . 2 1.3 Group actions . 7 1.4 Vertex-transitive graphs . 13 2 Coverings and liftings of automorphisms 23 2.1 Graph coverings and two group actions on the ¯bre . 23 2.2 Voltage spaces . 30 2.3 Covering isomorphism problem . 37 2.4 Lifting automorphism problem - classical approach . 42 2.5 Lifting of graph automorphisms in terms of voltages . 50 2.6 Lifting problem, case of abelian CT(p).......... 59 2.7 Lifting problem, case of elementary abelian CT(p).... 69 3 Applications 81 3.1 Enumeration of Graph Coverings . 81 3.2 Some applications of graph coverings . 90 3.2.1 Existence of regular graphs with large girth . 91 3.2.2 Large graphs of given degree and diameter 2 . 91 3.2.3 Spectrum of a graph and its covering graphs . 93 3.3 Flows . 95 Index 109 v Chapter 1 Graphs and Groups We begin with some basic de¯nitions and elementary properties of graphs and coverings. 1.1 Introduction In considerations in graph theory and more generally in combinatorics one has to deal with a problem of representation and controlling prop- erties of large structures, potentially based on unbounded number of elementary objects (vertices, points, edges). Several essentially di®erent techniques to deal with large objects were developed. Most usual are inductive constructions and arguments employing inductive arguments, counting arguments which led to the birth and development of the prob- abilistic method in graph theory and ¯nally, employing symmetries of structures one can use ¯nite groups to construct highly symmetrical graphs, designs, maps, geometries, etc, satisfying various combinato- rial properties. The latest approach is well-documented by a fruitful concept of a Cayley graph, introduced originally by group theorists in 19-th century to investigate groups. Topological graph theory deals with graphs as 1-dimensional topo- logical objects which are usually embedded to surfaces or to a more complex CW-complexes. The aim of this introductory chapter is to develop a consistent combinatorial theory of such graphs. In partic- ular, epimorphisms between graphs which are locally bijective, called graph coverings, will be investigated. We demonstrate the usefulness of 1 2 Chapter 1. Graphs and Groups graph coverings to solve several classical problems. Between the appli- cations the lifting automorphism problem is emphasized. There are two reasons: ¯rstly, the lifting automorphism problem and its applications in constructions of highly symmetrical graphs and maps received last decade a lot of attention in literature.
Load more

Recommended publications
  • Maximizing the Order of a Regular Graph of Given Valency and Second Eigenvalue∗
    SIAM J. DISCRETE MATH. c 2016 Society for Industrial and Applied Mathematics Vol. 30, No. 3, pp. 1509–1525 MAXIMIZING THE ORDER OF A REGULAR GRAPH OF GIVEN VALENCY AND SECOND EIGENVALUE∗ SEBASTIAN M. CIOABA˘ †,JACKH.KOOLEN‡, HIROSHI NOZAKI§, AND JASON R. VERMETTE¶ Abstract. From Alon√ and Boppana, and Serre, we know that for any given integer k ≥ 3 and real number λ<2 k − 1, there are only finitely many k-regular graphs whose second largest eigenvalue is at most λ. In this paper, we investigate the largest number of vertices of such graphs. Key words. second eigenvalue, regular graph, expander AMS subject classifications. 05C50, 05E99, 68R10, 90C05, 90C35 DOI. 10.1137/15M1030935 1. Introduction. For a k-regular graph G on n vertices, we denote by λ1(G)= k>λ2(G) ≥ ··· ≥ λn(G)=λmin(G) the eigenvalues of the adjacency matrix of G. For a general reference on the eigenvalues of graphs, see [8, 17]. The second eigenvalue of a regular graph is a parameter of interest in the study of graph connectivity and expanders (see [1, 8, 23], for example). In this paper, we investigate the maximum order v(k, λ) of a connected k-regular graph whose second largest eigenvalue is at most some given parameter λ. As a consequence of work of Alon and Boppana and of Serre√ [1, 11, 15, 23, 24, 27, 30, 34, 35, 40], we know that v(k, λ) is finite for λ<2 k − 1. The recent result of Marcus, Spielman, and Srivastava [28] showing the existence of infinite families of√ Ramanujan graphs of any degree at least 3 implies that v(k, λ) is infinite for λ ≥ 2 k − 1.
    [Show full text]
  • Framing Cyclic Revolutionary Emergence of Opposing Symbols of Identity Eppur Si Muove: Biomimetic Embedding of N-Tuple Helices in Spherical Polyhedra - /
    Alternative view of segmented documents via Kairos 23 October 2017 | Draft Framing Cyclic Revolutionary Emergence of Opposing Symbols of Identity Eppur si muove: Biomimetic embedding of N-tuple helices in spherical polyhedra - / - Introduction Symbolic stars vs Strategic pillars; Polyhedra vs Helices; Logic vs Comprehension? Dynamic bonding patterns in n-tuple helices engendering n-fold rotating symbols Embedding the triple helix in a spherical octahedron Embedding the quadruple helix in a spherical cube Embedding the quintuple helix in a spherical dodecahedron and a Pentagramma Mirificum Embedding six-fold, eight-fold and ten-fold helices in appropriately encircled polyhedra Embedding twelve-fold, eleven-fold, nine-fold and seven-fold helices in appropriately encircled polyhedra Neglected recognition of logical patterns -- especially of opposition Dynamic relationship between polyhedra engendered by circles -- variously implying forms of unity Symbol rotation as dynamic essential to engaging with value-inversion References Introduction The contrast to the geocentric model of the solar system was framed by the Italian mathematician, physicist and philosopher Galileo Galilei (1564-1642). His much-cited phrase, " And yet it moves" (E pur si muove or Eppur si muove) was allegedly pronounced in 1633 when he was forced to recant his claims that the Earth moves around the immovable Sun rather than the converse -- known as the Galileo affair. Such a shift in perspective might usefully inspire the recognition that the stasis attributed so widely to logos and other much-valued cultural and heraldic symbols obscures the manner in which they imply a fundamental cognitive dynamic. Cultural symbols fundamental to the identity of a group might then be understood as variously moving and transforming in ways which currently elude comprehension.
    [Show full text]
  • Algebraic Graph Theory: Automorphism Groups and Cayley Graphs
    Algebraic Graph Theory: Automorphism Groups and Cayley graphs Glenna Toomey April 2014 1 Introduction An algebraic approach to graph theory can be useful in numerous ways. There is a relatively natural intersection between the fields of algebra and graph theory, specifically between group theory and graphs. Perhaps the most natural connection between group theory and graph theory lies in finding the automorphism group of a given graph. However, by studying the opposite connection, that is, finding a graph of a given group, we can define an extremely important family of vertex-transitive graphs. This paper explores the structure of these graphs and the ways in which we can use groups to explore their properties. 2 Algebraic Graph Theory: The Basics First, let us determine some terminology and examine a few basic elements of graphs. A graph, Γ, is simply a nonempty set of vertices, which we will denote V (Γ), and a set of edges, E(Γ), which consists of two-element subsets of V (Γ). If fu; vg 2 E(Γ), then we say that u and v are adjacent vertices. It is often helpful to view these graphs pictorially, letting the vertices in V (Γ) be nodes and the edges in E(Γ) be lines connecting these nodes. A digraph, D is a nonempty set of vertices, V (D) together with a set of ordered pairs, E(D) of distinct elements from V (D). Thus, given two vertices, u, v, in a digraph, u may be adjacent to v, but v is not necessarily adjacent to u. This relation is represented by arcs instead of basic edges.
    [Show full text]
  • How Symmetric Are Real-World Graphs? a Large-Scale Study
    S S symmetry Article How Symmetric Are Real-World Graphs? A Large-Scale Study Fabian Ball * and Andreas Geyer-Schulz Karlsruhe Institute of Technology, Institute of Information Systems and Marketing, Kaiserstr. 12, 76131 Karlsruhe, Germany; [email protected] * Correspondence: [email protected]; Tel.: +49-721-608-48404 Received: 22 December 2017; Accepted: 10 January 2018; Published: 16 January 2018 Abstract: The analysis of symmetry is a main principle in natural sciences, especially physics. For network sciences, for example, in social sciences, computer science and data science, only a few small-scale studies of the symmetry of complex real-world graphs exist. Graph symmetry is a topic rooted in mathematics and is not yet well-received and applied in practice. This article underlines the importance of analyzing symmetry by showing the existence of symmetry in real-world graphs. An analysis of over 1500 graph datasets from the meta-repository networkrepository.com is carried out and a normalized version of the “network redundancy” measure is presented. It quantifies graph symmetry in terms of the number of orbits of the symmetry group from zero (no symmetries) to one (completely symmetric), and improves the recognition of asymmetric graphs. Over 70% of the analyzed graphs contain symmetries (i.e., graph automorphisms), independent of size and modularity. Therefore, we conclude that real-world graphs are likely to contain symmetries. This contribution is the first larger-scale study of symmetry in graphs and it shows the necessity of handling symmetry in data analysis: The existence of symmetries in graphs is the cause of two problems in graph clustering we are aware of, namely, the existence of multiple equivalent solutions with the same value of the clustering criterion and, secondly, the inability of all standard partition-comparison measures of cluster analysis to identify automorphic partitions as equivalent.
    [Show full text]
  • Some Topics Concerning Graphs, Signed Graphs and Matroids
    SOME TOPICS CONCERNING GRAPHS, SIGNED GRAPHS AND MATROIDS DISSERTATION Presented in Partial Fulfillment of the Requirements for the Degree Doctor of Philosophy in the Graduate School of the Ohio State University By Vaidyanathan Sivaraman, M.S. Graduate Program in Mathematics The Ohio State University 2012 Dissertation Committee: Prof. Neil Robertson, Advisor Prof. Akos´ Seress Prof. Matthew Kahle ABSTRACT We discuss well-quasi-ordering in graphs and signed graphs, giving two short proofs of the bounded case of S. B. Rao's conjecture. We give a characterization of graphs whose bicircular matroids are signed-graphic, thus generalizing a theorem of Matthews from the 1970s. We prove a recent conjecture of Zaslavsky on the equality of frus- tration number and frustration index in a certain class of signed graphs. We prove that there are exactly seven signed Heawood graphs, up to switching isomorphism. We present a computational approach to an interesting conjecture of D. J. A. Welsh on the number of bases of matroids. We then move on to study the frame matroids of signed graphs, giving explicit signed-graphic representations of certain families of matroids. We also discuss the cycle, bicircular and even-cycle matroid of a graph and characterize matroids arising as two different such structures. We study graphs in which any two vertices have the same number of common neighbors, giving a quick proof of Shrikhande's theorem. We provide a solution to a problem of E. W. Dijkstra. Also, we discuss the flexibility of graphs on the projective plane. We conclude by men- tioning partial progress towards characterizing signed graphs whose frame matroids are transversal, and some miscellaneous results.
    [Show full text]
  • Octonion Multiplication and Heawood's
    CONFLUENTES MATHEMATICI Bruno SÉVENNEC Octonion multiplication and Heawood’s map Tome 5, no 2 (2013), p. 71-76. <http://cml.cedram.org/item?id=CML_2013__5_2_71_0> © Les auteurs et Confluentes Mathematici, 2013. Tous droits réservés. L’accès aux articles de la revue « Confluentes Mathematici » (http://cml.cedram.org/), implique l’accord avec les condi- tions générales d’utilisation (http://cml.cedram.org/legal/). Toute reproduction en tout ou partie de cet article sous quelque forme que ce soit pour tout usage autre que l’utilisation á fin strictement personnelle du copiste est constitutive d’une infrac- tion pénale. Toute copie ou impression de ce fichier doit contenir la présente mention de copyright. cedram Article mis en ligne dans le cadre du Centre de diffusion des revues académiques de mathématiques http://www.cedram.org/ Confluentes Math. 5, 2 (2013) 71-76 OCTONION MULTIPLICATION AND HEAWOOD’S MAP BRUNO SÉVENNEC Abstract. In this note, the octonion multiplication table is recovered from a regular tesse- lation of the equilateral two timensional torus by seven hexagons, also known as Heawood’s map. Almost any article or book dealing with Cayley-Graves algebra O of octonions (to be recalled shortly) has a picture like the following Figure 0.1 representing the so-called ‘Fano plane’, which will be denoted by Π, together with some cyclic ordering on each of its ‘lines’. The Fano plane is a set of seven points, in which seven three-point subsets called ‘lines’ are specified, such that any two points are contained in a unique line, and any two lines intersect in a unique point, giving a so-called (combinatorial) projective plane [8,7].
    [Show full text]
  • On the Group-Theoretic Properties of the Automorphism Groups of Various Graphs
    ON THE GROUP-THEORETIC PROPERTIES OF THE AUTOMORPHISM GROUPS OF VARIOUS GRAPHS CHARLES HOMANS Abstract. In this paper we provide an introduction to the properties of one important connection between the theories of groups and graphs, that of the group formed by the automorphisms of a given graph. We provide examples of important results in graph theory that can be understood through group theory and vice versa, and conclude with a treatment of Frucht's theorem. Contents 1. Introduction 1 2. Fundamental Definitions, Concepts, and Theorems 2 3. Example 1: The Orbit-Stabilizer Theorem and its Application to Graph Automorphisms 4 4. Example 2: On the Automorphism Groups of the Platonic Solid Skeleton Graphs 4 5. Example 3: A Tight Bound on the Product of the Chromatic Number and Independence Number of Vertex-Transitive Graphs 6 6. Frucht's Theorem 7 7. Acknowledgements 9 8. References 9 1. Introduction Groups and graphs are two highly important kinds of structures studied in math- ematics. Interestingly, the theory of groups and the theory of graphs are deeply connected. In this paper, we examine one particular such connection: that which emerges from the observation that the automorphisms of any given graph form a group under composition. In section 2, we provide a framework for understanding the material discussed in the paper. In sections 3, 4, and 5, we demonstrate how important results in group theory illuminate some properties of automorphism groups, how the geo- metric properties of particular embeddings of graphs can be used to determine the structure of the automorphism groups of all embeddings of those graphs, and how the automorphism group can be used to determine fundamental truths about the structure of the graph.
    [Show full text]
  • Digraph Complexity Measures and Applications in Formal Language Theory
    Digraph Complexity Measures and Applications in Formal Language Theory by Hermann Gruber Institut f¨urInformatik Justus-Liebig-Universit¨at Giessen Germany November 14, 2008 Introduction and Motivation Measuring Complexity for Digraphs Algorithmic Results on Cycle Rank Applications in Formal Language Theory Discussion Overview 1 Introduction and Motivation 2 Measuring Complexity for Digraphs 3 Algorithmic Results on Cycle Rank 4 Applications in Formal Language Theory 5 Discussion H. Gruber Digraph Complexity Measures and Applications Introduction and Motivation Measuring Complexity for Digraphs Algorithmic Results on Cycle Rank Applications in Formal Language Theory Discussion Outline 1 Introduction and Motivation 2 Measuring Complexity for Digraphs 3 Algorithmic Results on Cycle Rank 4 Applications in Formal Language Theory 5 Discussion H. Gruber Digraph Complexity Measures and Applications Introduction and Motivation Measuring Complexity for Digraphs Algorithmic Results on Cycle Rank Applications in Formal Language Theory Discussion Complexity Measures on Undirected Graphs Important topic in algorithmic graph theory: Structural complexity restrictions can speed up algorithms Main result: many hard problems solvable in linear time on graphs with bounded treewidth. depending on application, also other measures interesting H. Gruber Digraph Complexity Measures and Applications Introduction and Motivation Measuring Complexity for Digraphs Algorithmic Results on Cycle Rank Applications in Formal Language Theory Discussion What about Directed
    [Show full text]
  • Coverings of Cubic Graphs and 3-Edge Colorability
    Discussiones Mathematicae Graph Theory 41 (2021) 311–334 doi:10.7151/dmgt.2194 COVERINGS OF CUBIC GRAPHS AND 3-EDGE COLORABILITY Leonid Plachta AGH University of Science and Technology Krak´ow, Poland e-mail: [email protected] Abstract Let h: G˜ → G be a finite covering of 2-connected cubic (multi)graphs where G is 3-edge uncolorable. In this paper, we describe conditions under which G˜ is 3-edge uncolorable. As particular cases, we have constructed regular and irregular 5-fold coverings f : G˜ → G of uncolorable cyclically 4-edge connected cubic graphs and an irregular 5-fold covering g : H˜ → H of uncolorable cyclically 6-edge connected cubic graphs. In [13], Steffen introduced the resistance of a subcubic graph, a char- acteristic that measures how far is this graph from being 3-edge colorable. In this paper, we also study the relation between the resistance of the base cubic graph and the covering cubic graph. Keywords: uncolorable cubic graph, covering of graphs, voltage permuta- tion graph, resistance, nowhere-zero 4-flow. 2010 Mathematics Subject Classification: 05C15, 05C10. 1. Introduction 1.1. Motivation and statement of results We will consider proper edge colorings of G. Let ∆(G) be the maximum degree of vertices in a graph G. Denote by χ′(G) the minimum number of colors needed for (proper) edge coloring of G and call it the chromatic index of G. Recall that according to Vizing’s theorem (see [14]), either χ′(G) = ∆(G), or χ′(G) = ∆(G)+1. In this paper, we shall consider only subcubic graphs i.e., graphs G such that ∆(G) ≤ 3.
    [Show full text]
  • Complexity and Geometry of Sampling Connected Graph Partitions
    COMPLEXITY AND GEOMETRY OF SAMPLING CONNECTED GRAPH PARTITIONS LORENZO NAJT∗, DARYL DEFORDy, JUSTIN SOLOMONy Abstract. In this paper, we prove intractability results about sampling from the set of partitions of a planar graph into connected components. Our proofs are motivated by a technique introduced by Jerrum, Valiant, and Vazirani. Moreover, we use gadgets inspired by their technique to provide families of graphs where the “flip walk" Markov chain used in practice for this sampling task exhibits exponentially slow mixing. Supporting our theoretical results we present some empirical evidence demonstrating the slow mixing of the flip walk on grid graphs and on real data. Inspired by connections to the statistical physics of self-avoiding walks, we investigate the sensitivity of certain popular sampling algorithms to the graph topology. Finally, we discuss a few cases where the sampling problem is tractable. Applications to political redistricting have recently brought increased attention to this problem, and we articulate open questions about this application that are highlighted by our results. 1. Introduction. The problem of graph partitioning, or dividing the vertices of a graph into a small number of connected subgraphs that extremize an objective function, is a classical task in graph theory with application to network analytics, machine learning, computer vision, and other areas. Whereas this task is well-studied in computation and mathematics, a related problem remains relatively understudied: understanding how a given partition compares to other members of the set of possible partitions. In this case, the goal is not to generate a partition with favorable properties, but rather to compare a given partition to some set of alternatives.
    [Show full text]
  • Self-Dual Configurations and Regular Graphs
    SELF-DUAL CONFIGURATIONS AND REGULAR GRAPHS H. S. M. COXETER 1. Introduction. A configuration (mci ni) is a set of m points and n lines in a plane, with d of the points on each line and c of the lines through each point; thus cm = dn. Those permutations which pre­ serve incidences form a group, "the group of the configuration." If m — n, and consequently c = d, the group may include not only sym­ metries which permute the points among themselves but also reci­ procities which interchange points and lines in accordance with the principle of duality. The configuration is then "self-dual," and its symbol («<*, n<j) is conveniently abbreviated to na. We shall use the same symbol for the analogous concept of a configuration in three dimensions, consisting of n points lying by d's in n planes, d through each point. With any configuration we can associate a diagram called the Menger graph [13, p. 28],x in which the points are represented by dots or "nodes," two of which are joined by an arc or "branch" when­ ever the corresponding two points are on a line of the configuration. Unfortunately, however, it often happens that two different con­ figurations have the same Menger graph. The present address is concerned with another kind of diagram, which represents the con­ figuration uniquely. In this Levi graph [32, p. 5], we represent the points and lines (or planes) of the configuration by dots of two colors, say "red nodes" and "blue nodes," with the rule that two nodes differently colored are joined whenever the corresponding elements of the configuration are incident.
    [Show full text]
  • List of NP-Complete Problems from Wikipedia, the Free Encyclopedia
    List of NP -complete problems - Wikipedia, the free encyclopedia Page 1 of 17 List of NP-complete problems From Wikipedia, the free encyclopedia Here are some of the more commonly known problems that are NP -complete when expressed as decision problems. This list is in no way comprehensive (there are more than 3000 known NP-complete problems). Most of the problems in this list are taken from Garey and Johnson's seminal book Computers and Intractability: A Guide to the Theory of NP-Completeness , and are here presented in the same order and organization. Contents ■ 1 Graph theory ■ 1.1 Covering and partitioning ■ 1.2 Subgraphs and supergraphs ■ 1.3 Vertex ordering ■ 1.4 Iso- and other morphisms ■ 1.5 Miscellaneous ■ 2 Network design ■ 2.1 Spanning trees ■ 2.2 Cuts and connectivity ■ 2.3 Routing problems ■ 2.4 Flow problems ■ 2.5 Miscellaneous ■ 2.6 Graph Drawing ■ 3 Sets and partitions ■ 3.1 Covering, hitting, and splitting ■ 3.2 Weighted set problems ■ 3.3 Set partitions ■ 4 Storage and retrieval ■ 4.1 Data storage ■ 4.2 Compression and representation ■ 4.3 Database problems ■ 5 Sequencing and scheduling ■ 5.1 Sequencing on one processor ■ 5.2 Multiprocessor scheduling ■ 5.3 Shop scheduling ■ 5.4 Miscellaneous ■ 6 Mathematical programming ■ 7 Algebra and number theory ■ 7.1 Divisibility problems ■ 7.2 Solvability of equations ■ 7.3 Miscellaneous ■ 8 Games and puzzles ■ 9 Logic ■ 9.1 Propositional logic ■ 9.2 Miscellaneous ■ 10 Automata and language theory ■ 10.1 Automata theory http://en.wikipedia.org/wiki/List_of_NP-complete_problems 12/1/2011 List of NP -complete problems - Wikipedia, the free encyclopedia Page 2 of 17 ■ 10.2 Formal languages ■ 11 Computational geometry ■ 12 Program optimization ■ 12.1 Code generation ■ 12.2 Programs and schemes ■ 13 Miscellaneous ■ 14 See also ■ 15 Notes ■ 16 References Graph theory Covering and partitioning ■ Vertex cover [1][2] ■ Dominating set, a.k.a.
    [Show full text]