DOCSLIB.ORG

Better Polynomial Algorithms for Scheduling Unit-Length Jobs with Bipartite Incompatibility Graphs on Uniform Machines

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Better Polynomial Algorithms for Scheduling Unit-Length Jobs with Bipartite Incompatibility Graphs on Uniform Machines BULLETIN OF THE POLISH ACADEMY OF SCIENCES TECHNICAL SCIENCES, Vol. 67, No. 1, 2019 DOI: 10.24425/bpas.2019.127335 Better polynomial algorithms for scheduling unit-length jobs with bipartite incompatibility graphs on uniform machines T. PIKIES* and M. KUBALE Department of Algorithms and System Modelling, Gdańsk University of Technology, ETI Faculty, Gabriela Narutowicza 11/12, 80-233 Gdańsk, Poland Abstract. The goal of this paper is to explore and to provide tools for the investigation of the problems of unit-length scheduling of incompat- ible jobs on uniform machines. We present two new algorithms that are a significant improvement over the known algorithms. The first one is Algorithm 2 which is 2-approximate for the problem Qm pj = 1, G = bisubquartic Cmax. The second one is Algorithm 3 which is 4-approximate for the problem Qm p = 1, G = bisubquartic ΣC , wherej m {2, 3, 4}. The theoryj behind the proposed algorithms is based on the properties j j 2 of 2-coloring with maximalj coloring width, andj on the properties of ideal machine, an abstract machine that we introduce in this paper. Key words: approximation algorithm, graph coloring, incompatible job, polynomial algorithm, scheduling, uniform machine, unit-time job. 1. Introduction partite subcubic (subquartic) graph is said to be bisubcubic (bi- subquartic). The symbol α(G) stands for the size of a maximum Suppose we have to process n bins of chemical substances independent set in G. We say that a graph is k-colorable if its and we have m parallel uniform machines, i.e. machines that vertices can be partitioned into k independent sets, called color have identical functionality but may have different processing classes, and by a k-coloring of G we mean such a partition of its speeds. On no machine can we process two substances that may vertices. The width of a coloring is the difference between the react with each other in order to guarantee machines safety or sizes of the largest and the smallest color class of the coloring. due to spacial reasons. The aim is such an assignment of the For other definitions the reader is referred to [10]. Conflicts bins to the machines that the processing time of all bins is as between jobs can be modeled by an incompatibility graph, i.e. short as possible or the mean flow time of a bin is as short as by a graph which has exactly one unique vertex assigned to possible. We assume here that each of the bins has to be pro- each of the jobs and which has an edge between a pair of ver- cessed on exactly one machine without interruptions. tices if the corresponding jobs cannot be processed on the same The problem can be expressed as the following scheduling machine. We say that jobs in a given set are compatible if the problem. Let us assume that we have n identical jobs with unit vertices corresponding to them form an independent set in the execution times. We also have m parallel uniform machines. incompatibility graph. They are uniform in the sense that the execution of a job on Now let us introduce some definitions concerning sched- a machine takes time inversely proportional to the speed of uling theory. Let us denote the set of jobs by J = { j1, …, jn}. Let the machine to be completed. There may be incompatibilities us also denote the set of the machines by M = {M1, …, Mm}. By between some jobs, that is, jobs belonging to incompatible s(M ) we denote the speed of machine M. Without loss of gener- pairs cannot be scheduled on the same machine. We consider ality we assume that s(M ) … s(M ), i.e. that the machines 1 ¸ ¸ m two criteria of optimality: the length of schedule and the total are ordered according to their speeds. By stotal = ∑ M M s(M ) completion time. we denote the sum of the speeds of all machines. A 2schedule Let us recall definitions of graph theory used further in this is for each job an allocation of a time interval to a machine paper. For a graph G = (V, E) by n(G) = V we denote the [2]. A subschedule is a schedule for a restricted set of jobs number of its vertices (nodes) and by e(G) =j Ej the number of J J on a restricted set of machines M M . By n (M ) 0 µ 0 µ S its edges. We denote by ∆(G) the maximum degreej j of a vertex we denote the number of jobs scheduled on machine M in in G. By V0(G) we mean the set of all vertices of a graph G a schedule S. By CS (M ) we denote the latest completion time with degree 0. A graph G is said to be a cubic (quartic) graph of the jobs scheduled on machine M in a schedule S. We have if it is 3-regular (4-regular). If, however, G fulfills ∆(G) 3 C (M ) = n (M )/s(M ). Thus the schedule length is equivalent ∙ S S (∆(G) 4) then it is called subcubic (subquartic). A bipartite to maxC (M ). Symbol Σ (N ) stands for the total completion ∙ S S cubic (quartic) graph is said to be bicubic (biquartic), and a bi- time of jobs from a set N J in a schedule S, therefore the µ total completion time is denoted by ΣS (J). By a greedy as- signment of compatible jobs to machines we understand an *e-mail: [email protected], [email protected] assignment in which the jobs are scheduled one by one and Manuscript submitted 2018-01-04, revised 2018-04-16, initially accepted each job is assigned to the machine that guarantees the shortest for publication 2018-05-08, published in February 2019. completion time at the moment of scheduling this job. In the Bull. Pol. Ac.: Tech. 67(1) 2019 31 T. Pikies and M. Kubale following algorithms all the assignments of jobs to machines 2. 2-coloring with maximal coloring width should be performed greedily, e.g. using an Algorithm given in [3]. We present a simple Algorithm that constructs a 2-coloring of For a set of the machines K M by an ideal machine M we a bipartite graph with maximal coloring width. µ id mean a machine with the speed equal to ∑M K s(M )Tytus, thatPikies, can Marek Kubale ignore incompatibilities between jobs. By C (2N) we denote the id Algorithm 1 Non-Equitable Coloring latestN completionJ scheduled time on of the the ideal jobs machine from setM Nid , hence J scheduledCid(N)= Algorithm 1 Non-Equitable Coloring ⊆ µ Input: A bipartite graph G. onN the/∑ idealM K smachine(M). By MΣidid, (henceN) we C denoteid(N ) = the N total/∑M completion K s(M ). Input: A bipartite graph G. | | ∈ j j 2 Bytime Σ of(N jobs) we from denote a set theN totalJ completionscheduled on time the idealof jobs machine from Output:Output: AA two-coloring two-coloring with with maximal coloring width id ⊆ a Msetid ,N hence JΣ idscheduled(N)=0.5 Non( theN + ideal1)/∑ machineM K s(M ).M , hence 1. Col1 = Col2 = /0 µ | | | | ∈ Tytusid Pikies, Marek Kubale1 2 Σid(ThereN) = 0.5 areN several( N papers+ 1)/∑ addressingM K s(M ) the. problem of schedul- 2. Let G1, …, ,...,GGc be beconnected connected components components of ofG G. j j j j 2 1 c ingThere with are incompatible several papers job constraintsaddressing the on identicalproblemTytus of machines. sched Pikies,- Marek3. Kubalei = 1 c N J scheduled on the ideal machine Mid, hence Cid(N)= Algorithm3. for i = 1 1 Non-Equitabletoto c dodo Coloring ulingHowever,⊆ with incompatible to the best of job our constraints knowledge, on thereidentical are fewmachines. results 4. Split V(G ) into color classes Col (G ) and Col (G ), N /∑ s(M). By Σid(N) we denote the total completion A bipartiteV( i) graph G. (1 )i (2 ) i N JM scheduledK on the ideal machine Mid, hence Cid(N)= Input:Algorithm4. Split 1 Non-EquitableGi into color Coloringclasses Col1 Gi and Col2 Gi , However,|involving⊆| ∈ to uniform the best machines. of our knowledge, The problem there isare hard few even results for where Col1(Gi) Col2(Gi) . timeN / of jobss( fromM). a By setΣN (NJ) wescheduled denote theon the total ideal completion machine Output:whereA two-coloring |Col (G )|≥| with Col maximal(G )| . coloring width identical∑M K machines. Theid authors⊆ of [1] have proved that even if Input:5. ColA bipartite= Col1 graphColi G(G. ). 2 i involvingM| id| , hence∈ uniformΣid(N)= machines.0.5 N ( NThe+ 1problem)/∑ sis( Mhard). even for 1. =1 j =1 j ¸1 j i j time of jobs from a set N J scheduledM onK the ideal machine Output:5. Col Col1 A Col= two-coloring Col2 ∪/0 Col with(G ) maximal. coloring width identicalthere are machines. only three The identical authors|⊆| | machines| of [1] have and∈ proved the incompatibili- that even 6. Col21 = Col21 [Col21(Gii). M There, hence areΣ several(N)= papers0.5 N addressing( N + 1)/ the problems(M). of schedul- 2. Let G1,...,Gc be∪ connected components of G. tiesid betweenid jobs can be modeled by a∑ bipartiteM K graph then the 1.6.7. Col Col1 =2 Col= Col2 =2 /0 Col2(Gi). ifing there with are incompatible only three identical job| | constraints| |machines on ∈and identical the incompati machines.- 3. endi for= c [ There are several papers addressing the problem of schedul- 2. forLet G ,...,1 toG dobe connected components of G.
Load more

Recommended publications
  • Parental Testing in Graph Theory?
    Parental Testing in Graph Theory ? By S Narjess Afzaly,∗ ANU CSIT Algorithm & Data Group, [email protected]. Supervisor: Brendan McKay.∗ Problem A sample of an irreducible graph To make a complete list of non-isomorphic simple quartic graphs with the given number of vertices. In a quartic graph, each vertex has exactly four neighbours. Applications Finding counterexamples, verifying some conjectures or refining some proofs whether in graph theory or in any other field where the problem can be modelled as a graph such as: chemistry, web mining, national security, the railway map, the electrical circuit and neural science. Our approach Canonical Construction Path (McKay 1998): A general method to recursively generate combinatorial objects in which larger objects, (Children), are constructed out of smaller ones, (Parents), by some well-defined operation, (extension), and avoiding constructing isomorphic copies at each construction step by defining a unique genuine parent for each graph. Hence a generated graph is only accepted if it has been Challenges extended from its genuine parent. • To avoid isomorphic copies when generating the list: Reduction: The inverse operation of the extension. Irreducible graph: A graph with no parent. The definition of the genuine parent can substantially affect the efficiency of the generation process. • Generating all irreducible graphs. Genuine parent 1 Has an isomorphic sibling Not genuine parent 2 2 3 4 5 5 6 5 5 6 6 7 5 8 9 6 10 10 11 10 10 11 12 10 10 11 10 10 11 12 12 12 13 10 10 11 10 13 12 Our Reduction: Deleting a vertex and adding two extra disjoint edges between its neighbours.
    [Show full text]
  • Fast Generation of Planar Graphs (Expanded Version)
    Fast generation of planar graphs (expanded version) Gunnar Brinkmann∗ Brendan D. McKay† Department of Applied Mathematics Department of Computer Science and Computer Science Australian National University Ghent University Canberra ACT 0200, Australia B-9000 Ghent, Belgium [email protected] [email protected] Abstract The program plantri is the fastest isomorph-free generator of many classes of planar graphs, including triangulations, quadrangulations, and convex polytopes. Many applications in the natural sciences as well as in mathematics have appeared. This paper describes plantri’s principles of operation, the basis for its efficiency, and the recursive algorithms behind many of its capabilities. In addition, we give many counts of isomorphism classes of planar graphs compiled using plantri. These include triangulations, quadrangulations, convex polytopes, several classes of cubic and quartic graphs, and triangulations of disks. This paper is an expanded version of the paper “Fast generation of planar graphs” to appeared in MATCH. The difference is that this version has substantially more tables. 1 Introduction The program plantri can rapidly generate many classes of graphs embedded in the plane. Since it was first made available, plantri has been used as a tool for research of many types. We give only a partial list, beginning with masters theses [37, 40] and PhD theses [32, 42]. Applications have appeared in chemistry [8, 21, 28, 39, 44], in crystallography [19], in physics [25], and in various areas of mathematics [1, 2, 7, 20, 22, 24, 41]. ∗Research supported in part by the Australian National University. †Research supported by the Australian Research Council. 1 The purpose of this paper is to describe the facilities of plantri and to explain in general terms the method of operation.
    [Show full text]
  • Smallest Cubic and Quartic Graphs with a Given Number of Cutpoints and Bridges Gary Chartrand
    Old Dominion University ODU Digital Commons Mathematics & Statistics Faculty Publications Mathematics & Statistics 1982 Smallest Cubic and Quartic Graphs With a Given Number of Cutpoints and Bridges Gary Chartrand Farrokh Saba John K. Cooper Jr. Frank Harary Curtiss E. Wall Old Dominion University Follow this and additional works at: https://digitalcommons.odu.edu/mathstat_fac_pubs Part of the Mathematics Commons Repository Citation Chartrand, Gary; Saba, Farrokh; Cooper, John K. Jr.; Harary, Frank; and Wall, Curtiss E., "Smallest Cubic and Quartic Graphs With a Given Number of Cutpoints and Bridges" (1982). Mathematics & Statistics Faculty Publications. 76. https://digitalcommons.odu.edu/mathstat_fac_pubs/76 Original Publication Citation Chartrand, G., Saba, F., Cooper, J. K., Harary, F., & Wall, C. E. (1982). Smallest cubic and quartic graphs with a given number of cutpoints and bridges. International Journal of Mathematics and Mathematical Sciences, 5(1), 41-48. doi:10.1155/s0161171282000052 This Article is brought to you for free and open access by the Mathematics & Statistics at ODU Digital Commons. It has been accepted for inclusion in Mathematics & Statistics Faculty Publications by an authorized administrator of ODU Digital Commons. For more information, please contact [email protected]. I nternat. J. Math. & Math. Sci. Vol. 5 No. (1982)41-48 41 SMALLEST CUBIC AND QUARTIC GRAPHS WITH A GIVEN NUMBER OF CUTPOINTS AND BRIDGES GARY CHARTRAND and FARROKH SABA Department of Mathematics, Western Michigan University Kalamazoo, Michigan 49008 U. S .A. JOHN K. COOPER, JR. Department of Mathematics, Eastern Michigan University Ypsilanti, Michigan 48197 U.S.A. FRANK HARARY Department of Mathematics, University of Michigan Ann Arbor, Michigan 48104 U.S.A.
    [Show full text]
  • Distance-Two Colorings of Barnette Graphs
    CCCG 2018, Winnipeg, Canada, August 8{10, 2018 Distance-Two Colorings of Barnette Graphs Tom´asFeder∗ Pavol Helly Carlos Subiz Abstract that the conjectures hold on the intersection of the two classes, i.e., that tri-connected cubic planar graphs with Barnette identified two interesting classes of cubic poly- all face sizes 4 or 6 are Hamiltonian. When all faces hedral graphs for which he conjectured the existence of have sizes 5 or 6, this was a longstanding open prob- a Hamiltonian cycle. Goodey proved the conjecture for lem, especially since these graphs (tri-connected cubic the intersection of the two classes. We examine these planar graphs with all face sizes 5 or 6) are the popu- classes from the point of view of distance-two color- lar fullerene graphs [8]. The second conjecture has now ings. A distance-two r-coloring of a graph G is an as- been affirmatively resolved in full [18]. For the first con- signment of r colors to the vertices of G so that any jecture, two of the present authors have shown in [10] two vertices at distance at most two have different col- that if the conjecture is false, then the Hamiltonicity ors. Note that a cubic graph needs at least four colors. problem for tri-connected cubic planar graphs is NP- The distance-two four-coloring problem for cubic planar complete. In view of these results and conjectures, in graphs is known to be NP-complete. We claim the prob- this paper we call bipartite tri-connected cubic planar lem remains NP-complete for tri-connected bipartite graphs type-one Barnette graphs; we call cubic plane cubic planar graphs, which we call type-one Barnette graphs with all face sizes 3; 4; 5 or 6 type-two Barnette graphs, since they are the first class identified by Bar- graphs; and finally we call cubic plane graphs with all nette.
    [Show full text]
  • Energy Landscapes for the Self-Assembly of Supramolecular Polyhedra
    JNonlinearSci DOI 10.1007/s00332-016-9286-9 Energy Landscapes for the Self-Assembly of Supramolecular Polyhedra Emily R. Russell1 Govind Menon2 · Received: 16 June 2015 / Accepted: 23 January 2016 ©SpringerScience+BusinessMediaNewYork2016 Abstract We develop a mathematical model for the energy landscape of polyhedral supramolecular cages recently synthesized by self-assembly (Sun et al. in Science 328:1144–1147, 2010). Our model includes two essential features of the experiment: (1) geometry of the organic ligands and metallic ions; and (2) combinatorics. The molecular geometry is used to introduce an energy that favors square-planar vertices 2 (modeling Pd + ions) and bent edges with one of two preferred opening angles (model- ing boomerang-shaped ligands of two types). The combinatorics of the model involve two-colorings of edges of polyhedra with four-valent vertices. The set of such two- colorings, quotiented by the octahedral symmetry group, has a natural graph structure and is called the combinatorial configuration space. The energy landscape of our model is the energy of each state in the combinatorial configuration space. The challenge in the computation of the energy landscape is a combinatorial explosion in the number of two-colorings of edges. We describe sampling methods based on the symmetries Communicated by Robert V. Kohn. ERR acknowledges the support and hospitality of the Institute for Computational and Experimental Research in Mathematics (ICERM) at Brown University, where she was a postdoctoral fellow while carrying out this work. GM acknowledges partial support from NSF grant DMS 14-11278. This research was conducted using computational resources at the Center for Computation and Visualization, Brown University.
    [Show full text]
  • Quartic Planar Graphs
    Quartic planar graphs Jane Tan October 2018 A thesis submitted for the degree of Bachelor of Philosophy (Honours) of the Australian National University Declaration The work in this thesis is my own except where otherwise stated. Jane Tan Acknowledgements First, I'd like to thank my supervisors, Brendan McKay and Scott Morrison. Brendan { your guidance has been invaluable. I'm so grateful for all of the exciting problems you've introduced me to, and that you're still putting up with me a full two years after you agreed to take me on \just for one semester". And Scott { thank you for your help with editing, your calming presence, and for sharing the good chalk. I would also like to thank all of the lecturers at the MSI who have been so generous with their time and from whom I have learnt so much. Special thanks to Vigleik, Joan and Andrew for teaching fantastic reading courses and supervising me in projects over the years. Thanks also go to all of the honours students, even the cookie monster and the elusive north-siders. It's been great fun sharing our shiny new office! Last but not least, thank you to my family for always being on the phone. v Abstract In this thesis, we explore three problems concerning quartic planar graphs. The first is on recursive structures; we prove generation theorems for several interest- ing subclasses of quartic planar graphs and their duals, building on previous work which has largely been focussed on the simple or nonplanar cases. The second problem is on the existence of locally self-avoiding Eulerian circuits.
    [Show full text]
  • Exploring Multistability in Prismatic Metamaterials Through Local Actuation
    ARTICLE https://doi.org/10.1038/s41467-019-13319-7 OPEN Exploring multistability in prismatic metamaterials through local actuation Agustin Iniguez-Rabago 1, Yun Li 1 & Johannes T.B. Overvelde 1* Metamaterials are artificial materials that derive their unusual properties from their periodic architecture. Some metamaterials can deform their internal structure to switch between different properties. However, the precise control of these deformations remains a challenge, 1234567890():,; as these structures often exhibit non-linear mechanical behavior. We introduce a compu- tational and experimental strategy to explore the folding behavior of a range of 3D prismatic building blocks that exhibit controllable multifunctionality. By applying local actuation pat- terns, we are able to explore and visualize their complex mechanical behavior. We find a vast and discrete set of mechanically stable configurations, that arise from local minima in their elastic energy. Additionally these building blocks can be assembled into metamaterials that exhibit similar behavior. The mechanical principles on which the multistable behavior is based are scale-independent, making our designs candidates for e.g., reconfigurable acoustic wave guides, microelectronic mechanical systems and energy storage systems. 1 AMOLF, Science Park 104, 1098 XG Amsterdam, Netherlands. *email: [email protected] NATURE COMMUNICATIONS | (2019) 10:5577 | https://doi.org/10.1038/s41467-019-13319-7 | www.nature.com/naturecommunications 1 ARTICLE NATURE COMMUNICATIONS | https://doi.org/10.1038/s41467-019-13319-7 n the search for materials with exotic properties, researchers polyhedron in the direction normal to the corresponding face have recently started to explore the design of their mesoscopic (Fig. 1). When assuming rigid origami29 (i.e., the structure can I 1 architecture .
    [Show full text]
  • G-Graphs: a New Representation of Groups
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Elsevier - Publisher Connector Journal of Symbolic Computation 42 (2007) 549–560 www.elsevier.com/locate/jsc G-graphs: A new representation of groups Alain Brettoa,∗, Alain Faisantb, Luc Gilliberta a Universite´ de Caen, GREYC CNRS UMR-6072. Campus 2, Bd Marechal Juin BP 5186, 14032 Caen cedex, France b Universite´ Jean Monnet LARAL 23 rue Paul Michelon, 42023 Saint-Etienne cedex 2, France Received 31 October 2004; accepted 8 August 2006 Available online 5 March 2007 Abstract An important part of computer science is focused on the links that can be established between group theory and graph theory and graphs. CAYLEY graphs, that establish such a link, are useful in a lot of areas of sciences. This paper introduces a new type of graph associated with a group, the G-graphs, and presents many of their properties. We show that various characteristics of a group can be seen on its associated G-graph. We also present an implementation of the algorithm constructing these new graphs, an implementation that will lead to some experimental results. Finally we show that many classical graphs are G-graphs. The relations between G-graphs and CAYLEY graphs are also studied. c 2007 Elsevier Ltd. All rights reserved. Keywords: Computational group theory; Graph representation of a group; Cayley graphs; G-graphs 1. Introduction Group theory can be considered as the study of symmetry. A group is basically the collection of symmetries of some object preserving some of its structure; therefore many sciences have to deal with groups.
    [Show full text]
  • Distance-Two Colorings of Barnette Graphs
    DISTANCE-TWO COLORINGS OF BARNETTE GRAPHS TOMAS´ FEDER, PAVOL HELL, AND CARLOS SUBI Abstract. Barnette identified two interesting classes of cubic polyhedral graphs for which he conjectured the existence of a Hamiltonian cycle. Goodey proved the conjecture for the intersection of the two classes. We examine these classes from the point of view of distance- two colorings. A distance-two r-coloring of a graph G is an assignment of r colors to the vertices of G so that any two vertices at distance at most two have different colors. Note that a cubic graph needs at least four colors. The distance-two four-coloring problem for cubic planar graphs is known to be NP-complete. We claim the problem remains NP-complete for tri-connected bipartite cubic planar graphs, which we call type-one Barnette graphs, since they are the first class identified by Barnette. By contrast, we claim the problem is polynomial for cubic plane graphs with face sizes 3; 4; 5; or 6, which we call type-two Barnette graphs, because of their relation to Barnette's second conjecture. We call Goodey graphs those type- two Barnette graphs all of whose faces have size 4 or 6. We fully describe all Goodey graphs that admit a distance-two four-coloring, and characterize the remaining type-two Barnette graphs that admit a distance-two four-coloring according to their face size. For quartic plane graphs, the analogue of type-two Barnette graphs are graphs with face sizes 3 or 4. For this class, the distance-two four-coloring problem is also polynomial; in fact, we can again fully describe all colorable instances { there are exactly two such graphs.
    [Show full text]
  • A Note on Coloring of 3/3-Power of Subquartic Graphs
    AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 79(3) (2021), Pages 454{460 3 A note on coloring of 3-power of subquartic graphs Mahsa Mozafari-Nia Moharram N. Iradmusa Department of Mathematical Sciences Shahid Beheshti University G.C. P.O. Box 19839-63113, Tehran Iran Abstract 1 For any k 2 N, the k-subdivision of a graph G is a simple graph G k , which is constructed by replacing each edge of G with a path of length k. In [M.N. Iradmusa, Discrete Math. 310 (10-11) (2010), 1551{1556], the mth power of the n-subdivision of G was introduced as a fractional m power of G, denoted by G n . F. Wang and X. Liu in [Discrete Math. 3 Algorithms Appl. 10 (3), (2018), 1850041] showed that χ(G 3 ) ≤ 7 for 3 any subcubic graph G. In this note, we prove that the 3 -power of every subquartic graph admits a proper coloring with at most nine colors. We 3 conjecture that χ(G 3 ) ≤ 2∆(G) + 1 for any graph G with maximum degree ∆(G) ≥ 2. 1 Introduction All graphs we consider in this note are simple, finite and undirected. We men- tion some of the definitions that are referred to throughout this note, and for other necessary definitions and notation we refer the reader to a standard text-book [2]. Minimum degree, maximum degree and maximum size of cliques of a graph G are denoted by δ(G), ∆(G) and !(G), respectively. For each vertex v 2 V (G), the neigh- bors of v are the vertices adjacent to v in G.
    [Show full text]
  • On Quartic Half-Arc-Transitive Metacirculants
    J Algebr Comb (2008) 28: 365–395 DOI 10.1007/s10801-007-0107-y On quartic half-arc-transitive metacirculants Dragan Marušicˇ · Primož Šparl Received: 7 June 2007 / Accepted: 6 November 2007 / Published online: 5 December 2007 © Springer Science+Business Media, LLC 2007 Abstract Following Alspach and Parsons, a metacirculant graph is a graph admit- ting a transitive group generated by two automorphisms ρ and σ , where ρ is (m, n)- semiregular for some integers m ≥ 1, n ≥ 2, and where σ normalizes ρ, cyclically permuting the orbits of ρ in such a way that σ m has at least one fixed vertex. A half- arc-transitive graph is a vertex- and edge- but not arc-transitive graph. In this arti- cle quartic half-arc-transitive metacirculants are explored and their connection to the so called tightly attached quartic half-arc-transitive graphs is explored. It is shown that there are three essentially different possibilities for a quartic half-arc-transitive metacirculant which is not tightly attached to exist. These graphs are extensively studied and some infinite families of such graphs are constructed. Keywords Graph · Metacirculant graph · Half-arc-transitive · Tightly attached · Automorphism group 1 Introductory and historic remarks Throughout this paper graphs are assumed to be finite and, unless stated otherwise, simple, connected and undirected (but with an implicit orientation of the edges when appropriate). For group-theoretic concepts not defined here we refer the reader to [4, 9, 34], and for graph-theoretic terms not defined here we refer the reader to [5]. Both authors were supported in part by “ARRS – Agencija za znanost Republike Slovenije”, program no.
    [Show full text]
  • Geometric Realizations of Cyclically Branched Coverings Over Punctured Spheres
    Geometric realizations of cyclically branched coverings over punctured spheres Dami Lee Abstract In classical differential geometry, a central question has been whether abstract sur- faces with given geometric features can be realized as surfaces in Euclidean space. Inspired by the rich theory of embedded triply periodic minimal surfaces, we seek ex- amples of triply periodic polyhedral surfaces that have an identifiable conformal struc- ture. In particular, we are interested in explicit cone metrics on compact Riemann surfaces that have a realization as the quotient of a triply periodic polyhedral surface. This is important as Riemann surfaces where one has equivalent descriptions are rare. We construct periodic surfaces using graph theory as an attempt to make Schoens heuristic concept of a dual graph rigorous. We then apply the theory of cyclically branched coverings to identify the conformal type of such surfaces. Contents 1 Introduction 2 2 A Regular Triply Periodic Polyhedral Surface 4 3 Cyclically Branched Covers Over Spheres 7 3.1 Construction of cyclically branched covers over spheres . .7 3.2 Maps between cyclically branched covers . 11 3.3 Cone metrics on punctured spheres . 13 3.4 Wronski metric and Weierstrass points . 18 arXiv:1809.06321v1 [math.DG] 17 Sep 2018 4 Regular Triply Periodic Polyhedral Surfaces 21 4.1 Triply periodic symmetric skeletal graphs . 22 4.2 Classification of regular triply periodic polyhedral surfaces . 24 5 Conformal Structures of Regular Triply Periodic Polyhedral Surfaces 29 5.1 Mucube, Muoctahedron, and Mutetrahedron . 30 5.2 Octa-8 . 34 5.3 Truncated Octa-8 . 36 5.4 Octa-4 . 37 6 Figure Credits 39 1 A All cyclically branched covers up to genus five 40 B Wronski computation for the Octa-4 surface 42 Bibliography 43 1 Introduction In classical differential geometry, a central question has been whether abstract surfaces with given geometric features can be realized as surfaces in Euclidean space.
    [Show full text]