DOCSLIB.ORG

Equitable Coloring of Prism Graph and It S Central,Middle, Total And

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text

Load more

INTERNATIONAL JOURNAL OF SCIENTIFIC & TECHNOLOGY RESEARCH VOLUME 8, ISSUE 08, AUGUST 2019 ISSN 2277-8616 Equitable Coloring Of Prism Graph And It’s Central,Middle, Total And Line Graph K.Praveena, M.Venkatachalam, A.Rohini, Dafik Abstract— A proper vertex coloring of a graph is equitable if the sizes of color classes differ by atmost one. The notion of equitable coloring was introduced by Meyer in 1973. In this paper we find the equitable chromatic number for Prism graph(Yn), the central graph of prism graph C(Yn), the middle graph of the prism graph M(Yn), the total graph of the prism graph T(Yn) and the line graph of the prism graph L(Yn). Index Terms—central graph, equitable coloring, equitable chromatic number, line graph, middle graph, prism graph, total graph. ———————————————————— 1 INTRODUCTION All graphs considered in this paper are connected, finite line graph of the prism graph휒 (L(푌 )). and simple. i.e.,undirected, loopless and without multiple edges. 2.1 Preliminaries: If the set of vertices of a graph G can be partitioned into k Some basic definitions are stated below for the work, classes 푉 , 푉 , … , 푉 such that each Vi is independent set and the condition ||푉 | − |푉 || ≤ 1 holds for every pair of (푖, 푗), then G Definition: 2.1 is said to be equitably k-colorable. The smallest integer k for For a given graph G = (V, E), we do an operation on G by which G is equitably k-colorable is known as Equitable subdividing each edge exactly once and joining all the non- chromatic number of G and it is denoted by 휒 (퐺) [7, 5, 10, 1]. adjacent vertices of G. The graph obtained by this process is Since Equitable coloring is a proper coloring with additional called central graph [6] of G denoted by C(G). constraints, we have 휒(퐺) ≤ 휒 (퐺) for any graph G [3]. In some discrete industrial systems one can encounter the Definition: 2.2 problem of equitable partitioning of a system with binary Let G be a graph with vertex set V (G) and the edge set conflicting relations into conflict-free sub systems. Such E(G). The middle graph [9, 10, 11] of the graph G denoted by situations can be modelled by means of a equitable graph M(G) is defined as follows: The vertex set of M(G) is V(G) ∪ coloring. E(G) in which two vertices x and y are adjacent in M(G) if the For example, in garbage collection problem [8] the vertices of following conditions holds the graph represent the garbage collection routes and pair of vertices is joined by an edge if the corresponding routes • x,y ∈ E(G), x,y are adjacent in G. should not be run on the same day. The problem of assigning • x ∈ V(G), y ∈ E(G) and they are incident in G. one of the six days of the week to each route thus reduces to the problem of six-coloring of the graph. In practice it might Definition: 2.3 be desirable to have an approximately equal number of routes Let G be a graph with vertex set V (G) and the edge set run on each of the six days. So one have to color the graph in E(G). The total graph [9, 10, 11] of the graph G is denoted by an equitable way with six colors. In contrast to the ordinary T(G) and is defined as follows: The vertex set of T(G) is V (G) ∪ proper coloring of the graph, the equitable coloring does not E(G). Two vertices x and y are adjacent in T(G) if the following possess monotonicity, namely a graph could be equitably k- conditions holds colorable without being equitably (푘 + 1) colorable. It seems to be that maximum degree plays a crucial role here [2]. • x,y ∈ E(G), x,y are adjacent in G. In this paper we investigate the equitable chromatic • x,y ∈ V (G), x,y are adjacent in G. number of Prism Graph (휒 (푌 )), the central graph of prism • x ∈V (G), y ∈ E(G), x,y are adjacent in G. graph 휒 (C(푌 )) the middle graph of the prism graph 휒 (M(푌 )), the total graph of the prism graph 휒 (T(푌 ) and the Definition: 2.4 The line graph [9, 10] of a graph G, denoted by L(G) is a ———————————————— graph whose vertices are the edges of G and if u,v ∈ E(G) then K.Praveena, Department of Computer Science, Dr.G.R.Damodaran college of uv ∈ E(L(G)) if u and v share a vertex in G. Science,Coimbatore,Tamilnadu, India. E-mail: [email protected] M.Venkatachalam Department of Mathematics, Kongunadu Arts and Science Definition: 2.5 College, Coimbatore, Tamil Nadu, India. E- mail: [email protected] A Prism graph 푌 sometimes also called a circular ladder Rohini, Department of Mathematics, Kongunadu Arts and Science College, graph and denoted by 퐶퐿 is a graph corresponding to the Coimbatore, Tamil Nadu, India. E- mail: [email protected] skeleton of an n-prism. An n-prism has 2푛 nodes and Dafik,University of Jemper, CGANT-Research Group, Department of 3푛 edges. 푌 is isomorphic to the graph cartesian product [4] Mathematics Education,Jember 68121, Indonesia. E-mail: [email protected] 퐿푛 = 퐾2 ◦ 퐶푛 where 퐾 is the complete graph with 2 vertices and Cn is the cycle of 푛 nodes. The prism graph 푌 consists an 706 IJSTR©2019 www.ijstr.org INTERNATIONAL JOURNAL OF SCIENTIFIC & TECHNOLOGY RESEARCH VOLUME 8, ISSUE 08, AUGUST 2019 ISSN 2277-8616 inner cycle and an outer cycle both connected by joining the V3 = {v3i : 1 ≤ i≤ k − 1} ∪ {u3i−2 : 1 ≤ i≤ k}. corresponding vertices. Clearly V1, V2 and V3 are independent sets of V (Yn). Throughout this paper, let *푣 : 1 ≤ 푖 ≤ 푛+ and *푢 : 1 ≤ Also |V1| = 2k − 1,|V2| = |V3| = 2k. This holds the 푖 ≤ 푛+ denote the vertices of inner and outer cycle taken in inequality ||Vi| − |Vj|| ≤ 1 ∀ (i,j) satisfying equitable cyclic order, respectively. Let *푒 : 1 ≤ 푖 ≤ 푛+ and {푒 : 1 ≤ coloring. 푖 ≤ 푛+ denote the edges of inner and outer cycle taken in cyclic order, respectively. Let *푠 : 1 ≤ 푖 ≤ 푛+ denote the edge 3. If n = 3k − 2, k = 3,5,7,9,11,…, then the partition of V *푢 푣 : 1 ≤ 푖 ≤ 푛+. is done as follows: 3 EQUITABLE COLORING OF PRISM GRAPH V1 = {v3i−2 : 1 ≤ i≤ k − 1} ∪ {u3i−1 : 1 ≤ i≤ k}. Theorem 3.1 V2 = {v3i−1 : 1 ≤ i≤ k} ∪ {u3i : 1 ≤ i≤ k − 1}. The Equitable chromatic number of prism graph 푌 , where 푛 is V3 = {v3i : 1 ≤ i≤ k − 1} ∪ {u3i−2 : 1 ≤ i≤ k − 1}. any positive integer is 2, 푛 푖푠 푒푣푒푛 휒 (푌 ) = { Clearly V1, V2 and V3 are independent sets of V (Yn). 3, 푛 푖푠 표푑푑 Also |V1|=|V2|= 2k−1,|V3| = 2k−2. This holds the Proof inequality ||Vi|−|Vj|| ≤ 1∀(i,j) satisfying equitable Let 푉 (푌 ) = *푣 , 푣 , … , 푣 + ∪ *푢 , 푢 , … , 푢 + where 푣 ′s are the coloring. vertices of the inner cycle taken in cyclic order and 푢 ′s are the From case 2, χ=(Yn) ≤ 3. vertices of the outer cycle taken in cyclic order such that each Since χ(Yn) ≥ 3 and 휒 (Yn) ≥ χ(Yn) ≥ 3, we have 휒 (Yn) ≥ 푣 푢 is the edge connecting the two cycles. 3. Therefore 휒 (Yn) = 3. Case 1: If n is even Let us partition the vertex set of the prism graph V (Yn) 4 EQUITABLE COLORING OF CENTRAL GRAPH OF PRISM GRAPH as Theorem 4.1 The Equitable chromatic number of central graph of prism graph 푉 = *푣 , 푣 , … , 푣 + ∪ *푢 , 푢 , … , 푢 + 푌 , where 푛 is any positive integer is and 휒 (C(Yn)) = n, n ≥ 3. 푉 = *푣 , 푣 , … , 푣 + ∪ *푢 , 푢 , … , 푢 + Proof ’ Clearly V1 and V2 are two independent sets of V (Yn). Also Let V (Yn) = {v1,v2,··· ,vn} ∪ {u1,u2,··· ,un} where vi s are |V1| = |V2| = n. This holds the inequality ||Vi|−|Vj|| ≤ 1 ∀ the vertices of the inner cycle taken in cyclic order and (i,j) satisfying equitable coloring. ui’s are the vertices of the outer cycle taken in cyclic order and E(Yn) = {ei : 1 ≤ i ≤ n − 1} ∪ {en} ∪ {ei’ : 1 ≤ i ≤ n ⇒휒 (Yn) ≤ 2 − 1} ∪ {푒푛′} ∪ {si’ : 1 ≤ i ≤ n} where ei is the edge 푣푖 푣푖+1 (1 Since χ(Yn) ≥ 2, 휒 (Yn) ≥ χ(Yn) ≥ 2, we have 휒 (Yn) ≥ 2. ≤ i ≤ n − 1), en is the edge 푣푛푢1, 푒푖′ is the edge 푢푖 푢푖+1 (1 ≤ Therefore 휒 (Yn) = 2. i ≤ n − 1), 푒푛′ is the edge unu1 and si is the edge 푣푖 푢푖 (1 ≤ i ≤ n). Case 2: If n is odd The equitable coloring is done in three different ways By the definition of central graph 푉(퐶(푌 )) = 푉(푌 ) ∪ 퐸(푌 ) = *푣 ∶ 1 ≤ 푖 ≤ 푛+ ∪ *푢 ∶ 1 ≤ 푖 ≤ 1. If n = 3k, k = 1,3,5,7,9,··· then the partition of V is 푛+ ∪ *푣 : 1 ≤ 푖 ≤ n+ ∪ *푢 : 1 ≤ 푖 ≤ 푛+ ∪ *푠 : 1 ≤ 푖 ≤ done as follows: ′ 푛+, where 푣 , 푢 and 푠푖′ represents the edge 푒푖, 푒푖and 푠푖 V1 = {v3i−2 : 1 ≤ i≤ k} ∪ {u3i−1 : 1 ≤ i≤ k}. respectively and joining all the non-adjacent vertices of Yn in C(Yn). V2 = {v3i−1 : 1 ≤ i≤ k} ∪ {u3i : 1 ≤ i≤ k}. Case 1: n is even V3 = {v3i : 1 ≤ i≤ k} ∪ {u3i−2 : 1 ≤ i≤ k}.
Recommended publications
  • Enumerating Graph Embeddings and Partial-Duals by Genus and Euler Genus

    Enumerating Graph Embeddings and Partial-Duals by Genus and Euler Genus

    numerative ombinatorics A pplications Enumerative Combinatorics and Applications ECA 1:1 (2021) Article #S2S1 ecajournal.haifa.ac.il Enumerating Graph Embeddings and Partial-Duals by Genus and Euler Genus Jonathan L. Grossy and Thomas W. Tuckerz yDepartment of Computer Science, Columbia University, New York, NY 10027 USA Email: [email protected] zDepartment of Mathematics, Colgate University, Hamilton, NY 13346, USA Email: [email protected] Received: September 2, 2020, Accepted: November 16, 2020, Published: November 20, 2020 The authors: Released under the CC BY-ND license (International 4.0) Abstract: We present an overview of an enumerative approach to topological graph theory, involving the derivation of generating functions for a set of graph embeddings, according to the topological types of their respective surfaces. We are mainly concerned with methods for calculating two kinds of polynomials: 1. the genus polynomial ΓG(z) for a given graph G, which is taken over all orientable embeddings of G, and the Euler-genus polynomial EG(z), which is taken over all embeddings; @ ∗ @ × @ ∗×∗ 2. the partial-duality polynomials EG(z); EG(z); and EG (z), which are taken over the partial-duals for all subsets of edges, for Poincar´eduality (∗), Petrie duality (×), and Wilson duality (∗×∗), respectively. We describe the methods used for the computation of recursions and closed formulas for genus polynomials and partial-dual polynomials. We also describe methods used to examine the polynomials pertaining to some special families of graphs or graph embeddings, for the possible properties of interpolation and log-concavity. Mathematics Subject Classifications: 05A05; 05A15; 05C10; 05C30; 05C31 Key words and phrases: Genus polynomial; Graph embedding; Log-concavity; Partial duality; Production matrix; Ribbon graph; Monodromy 1.
  • A Survey of the Studies on Gallai and Anti-Gallai Graphs 1. Introduction

    A Survey of the Studies on Gallai and Anti-Gallai Graphs 1. Introduction

    Communications in Combinatorics and Optimization Vol. 6 No. 1, 2021 pp.93-112 CCO DOI: 10.22049/CCO.2020.26877.1155 Commun. Comb. Optim. Review Article A survey of the studies on Gallai and anti-Gallai graphs Agnes Poovathingal1, Joseph Varghese Kureethara2,∗, Dinesan Deepthy3 1 Department of Mathematics, Christ University, Bengaluru, India [email protected] 2 Department of Mathematics, Christ University, Bengaluru, India [email protected] 3 Department of Mathematics, GITAM University, Bengaluru, India [email protected] Received: 17 July 2020; Accepted: 2 October 2020 Published Online: 4 October 2020 Abstract: The Gallai graph and the anti-Gallai graph of a graph G are edge disjoint spanning subgraphs of the line graph L(G). The vertices in the Gallai graph are adjacent if two of the end vertices of the corresponding edges in G coincide and the other two end vertices are nonadjacent in G. The anti-Gallai graph of G is the complement of its Gallai graph in L(G). Attributed to Gallai (1967), the study of these graphs got prominence with the work of Sun (1991) and Le (1996). This is a survey of the studies conducted so far on Gallai and anti-Gallai of graphs and their associated properties. Keywords: Line graphs, Gallai graphs, anti-Gallai graphs, irreducibility, cograph, total graph, simplicial complex, Gallai-mortal graph AMS Subject classification: 05C76 1. Introduction All the graphs under consideration are simple and undirected, but are not necessarily finite. The vertex set and the edge set of the graph G are denoted by V (G) and E(G) respectively.
  • A Survey of Graph Coloring - Its Types, Methods and Applications

    A Survey of Graph Coloring - Its Types, Methods and Applications

    FOUNDATIONS OF COMPUTING AND DECISION SCIENCES Vol. 37 (2012) No. 3 DOI: 10.2478/v10209-011-0012-y A SURVEY OF GRAPH COLORING - ITS TYPES, METHODS AND APPLICATIONS Piotr FORMANOWICZ1;2, Krzysztof TANA1 Abstract. Graph coloring is one of the best known, popular and extensively researched subject in the eld of graph theory, having many applications and con- jectures, which are still open and studied by various mathematicians and computer scientists along the world. In this paper we present a survey of graph coloring as an important subeld of graph theory, describing various methods of the coloring, and a list of problems and conjectures associated with them. Lastly, we turn our attention to cubic graphs, a class of graphs, which has been found to be very interesting to study and color. A brief review of graph coloring methods (in Polish) was given by Kubale in [32] and a more detailed one in a book by the same author. We extend this review and explore the eld of graph coloring further, describing various results obtained by other authors and show some interesting applications of this eld of graph theory. Keywords: graph coloring, vertex coloring, edge coloring, complexity, algorithms 1 Introduction Graph coloring is one of the most important, well-known and studied subelds of graph theory. An evidence of this can be found in various papers and books, in which the coloring is studied, and the problems and conjectures associated with this eld of research are being described and solved. Good examples of such works are [27] and [28]. In the following sections of this paper, we describe a brief history of graph coloring and give a tour through types of coloring, problems and conjectures associated with them, and applications.
  • Switching 3-Edge-Colorings of Cubic Graphs Arxiv:2105.01363V1 [Math.CO] 4 May 2021

    Switching 3-Edge-Colorings of Cubic Graphs Arxiv:2105.01363V1 [Math.CO] 4 May 2021

    Switching 3-Edge-Colorings of Cubic Graphs Jan Goedgebeur Department of Computer Science KU Leuven campus Kulak 8500 Kortrijk, Belgium and Department of Applied Mathematics, Computer Science and Statistics Ghent University 9000 Ghent, Belgium [email protected] Patric R. J. Osterg˚ard¨ Department of Communications and Networking Aalto University School of Electrical Engineering P.O. Box 15400, 00076 Aalto, Finland [email protected] In loving memory of Johan Robaey Abstract The chromatic index of a cubic graph is either 3 or 4. Edge- Kempe switching, which can be used to transform edge-colorings, is here considered for 3-edge-colorings of cubic graphs. Computational results for edge-Kempe switching of cubic graphs up to order 30 and bipartite cubic graphs up to order 36 are tabulated. Families of cubic graphs of orders 4n + 2 and 4n + 4 with 2n edge-Kempe equivalence classes are presented; it is conjectured that there are no cubic graphs arXiv:2105.01363v1 [math.CO] 4 May 2021 with more edge-Kempe equivalence classes. New families of nonplanar bipartite cubic graphs with exactly one edge-Kempe equivalence class are also obtained. Edge-Kempe switching is further connected to cycle switching of Steiner triple systems, for which an improvement of the established classification algorithm is presented. Keywords: chromatic index, cubic graph, edge-coloring, edge-Kempe switch- ing, one-factorization, Steiner triple system. 1 1 Introduction We consider simple finite undirected graphs without loops. For such a graph G = (V; E), the number of vertices jV j is the order of G and the number of edges jEj is the size of G.
  • Equitable Coloring of Corona Products of Cubic Graphs Is Harder Than Ordinary Coloring∗

    Equitable Coloring of Corona Products of Cubic Graphs Is Harder Than Ordinary Coloring∗

    Also available at http://amc-journal.eu ISSN 1855-3966 (printed edn.), ISSN 1855-3974 (electronic edn.) ARS MATHEMATICA CONTEMPORANEA 10 (2016) 333–347 Equitable coloring of corona products of cubic graphs is harder than ordinary coloring∗ Hanna Furmanczyk´ Institute of Informatics, University of Gda´nsk,Wita Stwosza 57, 80-952 Gda´nsk, Poland Marek Kubale Department of Algorithms and System Modelling, Technical University of Gda´nsk, Narutowicza 11/12, 80-233 Gda´nsk, Poland Received 21 June 2014, accepted 15 September 2015, published online 5 February 2016 Abstract A graph is equitably k-colorable if its vertices can be partitioned into k independent sets in such a way that the number of vertices in any two sets differ by at most one. The smallest k for which such a coloring exists is known as the equitable chromatic number of G and it is denoted by χ=(G). In this paper the problem of determinig χ= for coronas of cubic graphs is studied. Although the problem of ordinary coloring of coronas of cubic graphs is solvable in polynomial time, the problem of equitable coloring becomes NP-hard for these graphs. We provide polynomially solvable cases of coronas of cubic graphs and prove the NP-hardness in a general case. As a by-product we obtain a simple linear time algorithm for equitable coloring of such graphs which uses χ=(G) or χ=(G) + 1 colors. Our algorithm is best possible, unless P=NP. Consequently, cubical coronas seem to be the only known class of graphs for which equitable coloring is harder than ordinary coloring.
  • Arxiv:2011.14609V1 [Math.CO] 30 Nov 2020 Vertices in Different Partition Sets Are Linked by a Hamilton Path of This Graph

    Arxiv:2011.14609V1 [Math.CO] 30 Nov 2020 Vertices in Different Partition Sets Are Linked by a Hamilton Path of This Graph

    Symmetries of the Honeycomb toroidal graphs Primož Šparla;b;c aUniversity of Ljubljana, Faculty of Education, Ljubljana, Slovenia bUniversity of Primorska, Institute Andrej Marušič, Koper, Slovenia cInstitute of Mathematics, Physics and Mechanics, Ljubljana, Slovenia Abstract Honeycomb toroidal graphs are a family of cubic graphs determined by a set of three parameters, that have been studied over the last three decades both by mathematicians and computer scientists. They can all be embedded on a torus and coincide with the cubic Cayley graphs of generalized dihedral groups with respect to a set of three reflections. In a recent survey paper B. Alspach gathered most known results on this intriguing family of graphs and suggested a number of research problems regarding them. In this paper we solve two of these problems by determining the full automorphism group of each honeycomb toroidal graph. Keywords: automorphism; honeycomb toroidal graph; cubic; Cayley 1 Introduction In this short paper we focus on a certain family of cubic graphs with many interesting properties. They are called honeycomb toroidal graphs, mainly because they can be embedded on the torus in such a way that the corresponding faces are hexagons. The usual definition of these graphs is purely combinatorial where, somewhat vaguely, the honeycomb toroidal graph HTG(m; n; `) is defined as the graph of order mn having m disjoint “vertical” n-cycles (with n even) such that two consecutive n-cycles are linked together by n=2 “horizontal” edges, linking every other vertex of the first cycle to every other vertex of the second one, and where the last “vertcial” cycle is linked back to the first one according to the parameter ` (see Section 3 for a precise definition).
  • On the Gonality of Cartesian Products of Graphs

    On the Gonality of Cartesian Products of Graphs

    On the gonality of Cartesian products of graphs Ivan Aidun∗ Ralph Morrison∗ Department of Mathematics Department of Mathematics and Statistics University of Madison-Wisconsin Williams College Madison, WI, USA Williamstown, MA, USA [email protected] [email protected] Submitted: Jan 20, 2020; Accepted: Nov 20, 2020; Published: Dec 24, 2020 c The authors. Released under the CC BY-ND license (International 4.0). Abstract In this paper we provide the first systematic treatment of Cartesian products of graphs and their divisorial gonality, which is a tropical version of the gonality of an algebraic curve defined in terms of chip-firing. We prove an upper bound on the gonality of the Cartesian product of any two graphs, and determine instances where this bound holds with equality, including for the m × n rook's graph with minfm; ng 6 5. We use our upper bound to prove that Baker's gonality conjecture holds for the Cartesian product of any two graphs with two or more vertices each, and we determine precisely which nontrivial product graphs have gonality equal to Baker's conjectural upper bound. We also extend some of our results to metric graphs. Mathematics Subject Classifications: 14T05, 05C57, 05C76 1 Introduction In [7], Baker and Norine introduced a theory of divisors on finite graphs in parallel to divisor theory on algebraic curves. If G = (V; E) is a connected multigraph, one treats G as a discrete analog of an algebraic curve of genus g(G), where g(G) = jEj − jV j + 1. This program was extended to metric graphs in [15] and [21], and has been used to study algebraic curves through combinatorial means.
  • A Note on the Equitable Choosability of Complete Bipartite Graphs

    A Note on the Equitable Choosability of Complete Bipartite Graphs

    Discussiones Mathematicae Graph Theory 41 (2021) 1091–1101 https://doi.org/10.7151/dmgt.2232 A NOTE ON THE EQUITABLE CHOOSABILITY OF COMPLETE BIPARTITE GRAPHS Jeffrey A. Mudrock, Madelynn Chase, Ezekiel Thornburgh Isaac Kadera and Tim Wagstrom Department of Mathematics College of Lake County Grayslake, IL 60030 e-mail: [email protected] Abstract In 2003 Kostochka, Pelsmajer, and West introduced a list analogue of equitable coloring called equitable choosability. A k-assignment, L, for a graph G assigns a list, L(v), of k available colors to each v ∈ V (G), and an equitable L-coloring of G is a proper coloring, f, of G such that f(v) ∈ L(v) for each v ∈ V (G) and each color class of f has size at most ⌈|V (G)|/k⌉. Graph G is said to be equitably k-choosable if an equitable L-coloring of G exists whenever L is a k-assignment for G. In this note we study the equitable choosability of complete bipartite graphs. A result of Kostochka, Pelsmajer, and West implies Kn,m is equitably k-choosable if k ≥ max{n, m} provided Kn,m = K2l+1,2l+1. We prove Kn,m is equitably k-choosable if m ≤ ⌈(m + n)/k⌉ (k − n) which gives Kn,m is equitably k-choosable for certain k satisfying k < max{n, m}. We also give a complete characterization of the equitable choosability of complete bipartite graphs that have a partite set of size at most 2. Keywords: graph coloring, equitable coloring, list coloring, equitable choos- ability. 2010 Mathematics Subject Classification: 05C15.
  • The Graph Curvature Calculator and the Curvatures of Cubic Graphs

    The Graph Curvature Calculator and the Curvatures of Cubic Graphs

    The Graph Curvature Calculator and the curvatures of cubic graphs D. Cushing1, R. Kangaslampi2, V. Lipi¨ainen3, S. Liu4, and G. W. Stagg5 1Department of Mathematical Sciences, Durham University 2Computing Sciences, Tampere University 3Department of Mathematics and Systems Analysis, Aalto University 4School of Mathematical Sciences, University of Science and Technology of China 5School of Mathematics, Statistics and Physics, Newcastle University August 20, 2019 Abstract We classify all cubic graphs with either non-negative Ollivier-Ricci curvature or non-negative Bakry-Emery´ curvature everywhere. We show in both curvature notions that the non-negatively curved graphs are the prism graphs and the M¨obiusladders. As a consequence of the classification result we show that non-negatively curved cubic expanders do not exist. We also introduce the Graph Curvature Calculator, an online tool developed for calculating the curvature of graphs under several variants of the curvature notions that we use in the classification. 1 Introduction and statement of results Ricci curvature is a fundamental notion in the study of Riemannian manifolds. This notion has been generalised in various ways from the smooth setting of manifolds to more general metric spaces. This article considers Ricci curvature notions in the discrete setting of graphs. Several adaptations of Ricci curvature such as Bakry-Emery´ curvature (see e.g. [20, 18, 8]), Ollivier-Ricci curvature [32], Entropic curvature introduced by Erbar and Maas [11], and Forman curvature [14, 36], have emerged on graphs in recent years, and there is very active research on these notions. We refer to [3, 27] and the references therein for this vibrant research field.
  • On Equitable -Coloring of Graphs with Low Average Degree

    On Equitable -Coloring of Graphs with Low Average Degree

    CORE Metadata, citation and similar papers at core.ac.uk Provided by Elsevier - Publisher Connector Theoretical Computer Science 349 (2005) 82–91 www.elsevier.com/locate/tcs On equitable -coloring of graphs with low average degreeଁ A.V. Kostochkaa,b,∗, K. Nakprasita aDepartment of Mathematics, The University of Illinois, Urbana, IL 61801, USA bInstitute of Mathematics, Novosibirsk, Russia Abstract An equitable coloring of a graph is a proper vertex coloring such that the sizes of any two color classes differ by at most 1. Hajnal and Szemerédi proved that every graph with maximum degree is equitably k-colorable for every k + 1. Chen, Lih, and Wu conjectured that every connected graph with maximum degree 3 distinct from K+1 and K, is equitably -colorable. This conjecture has been proved for graphs in some classes such as bipartite graphs, outerplanar graphs, graphs with maximum degree 3, interval graphs. We prove that this conjecture holds for graphs with average degree at most /5. © 2005 Elsevier B.V. All rights reserved. Keywords: Equitable coloring; Average degree; Brooks’ Theorem 1. Introduction In several applications of coloring as a partition problem there is an additional requirement that color classes be not so large or be of approximately the same size. Examples are the mutual exclusion scheduling problem [1,17], scheduling in communication systems [7], construction timetables [9], and round-a-clock scheduling [18]. For other applications in scheduling, partitioning, and load balancing problems, one can look into [2,12,17]. A model imposing such a requirement is equitable coloring—a proper coloring such that color classes differ in size by at most one.
  • Only-Prism and Only-Pyramid Graphs Emilie Diot, Marko Radovanović, Nicolas Trotignon, Kristina Vušković

    Only-Prism and Only-Pyramid Graphs Emilie Diot, Marko Radovanović, Nicolas Trotignon, Kristina Vušković

    The (theta, wheel)-free graphs Part I: only-prism and only-pyramid graphs Emilie Diot, Marko Radovanović, Nicolas Trotignon, Kristina Vušković To cite this version: Emilie Diot, Marko Radovanović, Nicolas Trotignon, Kristina Vušković. The (theta, wheel)-free graphs Part I: only-prism and only-pyramid graphs. Journal of Combinatorial Theory, Series B, Elsevier, 2020, 143, pp.123-147. 10.1016/j.jctb.2017.12.004. hal-03060180 HAL Id: hal-03060180 https://hal.archives-ouvertes.fr/hal-03060180 Submitted on 13 Dec 2020 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. The (theta, wheel)-free graphs Part I: only-prism and only-pyramid graphs Emilie Diot∗, Marko Radovanovi´cy, Nicolas Trotignonz, Kristina Vuˇskovi´cx August 24, 2018 Abstract Truemper configurations are four types of graphs (namely thetas, wheels, prisms and pyramids) that play an important role in the proof of several decomposition theorems for hereditary graph classes. In this paper, we prove two structure theorems: one for graphs with no thetas, wheels and prisms as induced subgraphs, and one for graphs with no thetas, wheels and pyramids as induced subgraphs. A consequence is a polynomial time recognition algorithms for these two classes.
  • Achromatic Colouring of the Central Graph of Some Specialgraphs

    Achromatic Colouring of the Central Graph of Some Specialgraphs

    International Journal of Innovative Technology and Exploring Engineering (IJITEE) ISSN: 2278-3075, Volume-8, Issue-11S, September 2019 Achromatic Colouring of the Central Graph of Some Specialgraphs K.P.Thilagavathy, A.Santha, G.S. Nandakumar Abstract— In this research investigation, the achromatic number of central graph of double wheel graph, wind mill graph andn- anti prism graph have been studied. In addition the structural properties of these graphs have also been studied. Key Words: Double wheel graph, Wind mill graph, Anti prism graph, achromatic number, b-chromatic number, Central graph Mathematics subject classification: 05C15 I. INTRODUCTION Wind mill graph Consider a simple undirected graph G . To form its central graph C(G) , we introduce a new node on every An anti prism is a semi regular polyhedron constructed with gons and triangles. It is made edge in and join those nodes of that are not up of two gons on the top and bottom separated by a adjacent.The achromatic number was introduced by Harary. ribbon of triangles, with the two gons being offset A proper vertex colouring is said to be achromatic if every by one ribbon. The graph corresponding to the skeleton of pair of colours has at least one edge joining them . The an anti prism is called the anti prism graph and is achromatic number is the maximum number of colours denoted by in an achromatic colouring of . A double wheel graph of size is composed of and It consists of two cycles of size where the vertices of the two cycles are connected to a central root vertex.