DOCSLIB.ORG

The Second Malta Conference in Graph Theory and Combinatorics 2017

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text

Load more

The Second Malta Conference in Graph Theory and Combinatorics 2017 2MCGTC-2017 in honour of the 75th birthday of Professor Stanley Fiorini 26{30 June 2017 ii Welcome Address Mer~ba! We are honoured that you chose to join us for The Second Malta Confer- ence in Graph Theory and Combinatorics. This conference is commemorating the 75th birthday of Professor Stanley Fiorini, who introduced graph theory and combinatorics at the University of Malta. Many of you may be asking when the previous Malta Conference was held? The First Malta Conference on Graphs and Combinatorics was held during the period 28 May { 2 June, 1990, at the Suncrest Hotel, also in Qawra, St Paul's Bay. It differed from a number of similar conferences held in the central Mediterranean region at that time in that it consisted of three types of lectures. L´aszl´oLov´aszand Carsten Thomassen delivered two instructional courses of five one-hour lectures each; the former was A survey of independent sets in graphs and the latter was on Embeddings of graphs. There were also four invited speakers, namely L.W. Beineke, N.L. Biggs, R. Graham and D.J.A. Welsh, each of whom gave a one-hour lecture. The third type of talks were the 20-minute contributed talks running in two parallel sessions and given by 39 speakers. Volume 124 (1994) of the journal Discrete Mathematics was a special edition dedicated to this conference; it was edited by Stanley Fiorini and Josef Lauri, and it consisted of 22 selected papers. Twenty-seven years later we are gathered here for the second such conference organ- ised in the Island of Malta. Although the time-lapse is considerable, the purpose iii of this conference remains the same as that of the first one: to share and discuss a whole spectrum of topics within the interrelated fields of graph theory and com- binatorics. This conference is bringing together almost 200 researchers and mathe- maticians from 46 different countries spread across all the continents, including 14 invited speakers and a special guest of honour. We have received 150 abstracts for 20-minute contributed talks which will run in four parallel sessions and cover a large variety of areas within graph theory and combinatorics. A special issue of Discrete Applied Mathematics dedicated to this conference and containing full-length papers will be published. This Conference was made possible by the support of the University of Malta and through the financial support we received from our sponsors, whom we thank whole- heartedly. We would also like to thank all those who have helped in some way or another to make this Conference possible. Our final words of thanks go to all of you who are gathered here with us on our tiny Island, and we wish you an enjoyable and successful conference here in Qawra, St Paul's Bay. Finally, our gratitude goes to Professor Fiorini, without whose invaluable contribu- tion we would not be here today. Ad multos annos! Peter Borg John Baptist Gauci Josef Lauri Irene Sciriha 18 June 2017 iv Contents Welcome Address iii Professor Stanley Fiorini 1 Short biography . .1 List of Publications in Mathematics . .2 Conference Information 5 Conference Sponsors 7 The Programme 9 Overview . .9 Daily . 10 Monday 26 June 2017 . 10 Tuesday 27 June 2017 . 11 Wednesday 28 June 2017 . 11 Thursday 29 June 2017 . 12 Friday 30 June 2017 . 13 Abstracts of Plenary Talks 15 Alternating Sign Matrices and Hypermatrices (Richard A. Brualdi).... 15 Repetitions in the degree sequence of a graph (Yair Caro)......... 15 The Diameter of Graphs and Digraphs (Peter Dankelmann)........ 18 Graph theoretical models and molecular currents (Patrick Fowler)..... 18 Quantum Walks on Graphs (Chris Godsil).................. 19 On the direct product of finite and infinite graphs (Wilfried Imrich).... 19 A general 2-part Erd}os-Ko-Radotheorem (Gyula O. H. Katona)...... 20 Packing Chromatic Number (Sandi Klavˇzar)................. 20 Introduction to total graph coherent configurations (Mikhail Klin)..... 21 Tiling in High Dimensions (Imre Leader)................... 22 Graph generation and Ramsey numbers (Brendan McKay)......... 22 Cocliques in Derangement Graphs (Karen Meagher)............. 22 Symmetry in graphs and digraphs (Raffaele Scapellato)........... 23 List colourings of hypergraphs (Andrew Thomason)............. 23 v Abstracts of Contributed Talks 25 An application of Hoffman graphs for spectral characterizations of graphs (Aida Abiad)............................... 25 Formation of a giant component in the intersection graph of a random chord diagram (Huseyin Acan)...................... 25 Vertex transitive K¨ahlergraphs whose adjacency operators are commuta- tive (Toshiaki Adachi).......................... 26 Investigating posets via their maximal chains: a Sperner type approach (Seyed Hadi Afzali Borujeni)...................... 27 Baranyai's Theorem for Completeness of Bipartite Induced Subhypergraph (Yasmeen Akhtar)............................ 28 Coherent Graph Partitions (Angela Angeleska)................ 28 Generating theorem of even triangulation on the Klein bottle (Yoshihiro Asayama)................................. 29 Graphs with large vertex and edge reconstruction number (Kevin Joseph Asciak).................................. 30 Localization theorems on Hamilton cycles (Armen Asratian)........ 30 Orthogonal matrices with zero diagonal (Robert Bailey)........... 31 Extremal K5-minor-free graphs with fixed girth (J´anosBar´at)....... 32 Real spectra in non-Hermitian operators (Nat´aliaBebiano)......... 32 Counting Matchings in a class of Fullerene Graphs (Afshin Behmaram).. 33 Minimum Spanning Tree of the Inner Dualist of Honeycomb Graphs (Faqir M. Bhatti)................................. 35 An Equivalence Class Decomposition of Finite Metric Spaces via Gromov Products (Ay¸seH¨umeyra Bilge)..................... 35 Simple Pattern Minimality Problem: two variants and heuristic approaches (Maurizio Boccia)............................. 36 Non-existence of indecomposable 1-factorizations of the complete multi- graph λK2n (Simona Bonvicini)..................... 37 Bipartite graphs in the SSP model of ballistic conduction (Martha Borg). 38 Cross-intersecting families (Peter Borg).................... 39 On the Super Connectivity of Kneser graphs and Johnson graphs (G¨ulnaz Boruzanlı Ekinci)............................. 40 On χ-binding functions for the classes of P5-, 2K2-, and K1;3-free graphs (Christoph Brause)............................ 40 Clique coverings and claw-free graphs (Csilla Bujt´as)............ 41 Exploring soft graphs (Jean-Guy Caputo).................. 42 Generalized connectivity and strong product graph (Roc´ıoM. Casablanca) 43 The Clustered and Bottleneck Clustered Selected-Internal Steiner Tree Problems (Yen Hung Chen)....................... 44 Skolem Labellings of Graphs with Large Chordless Cycles (Nancy E. Clarke) 45 Independent Sets of Families of Graphs via Finite State Automata (Pietro Codara).................................. 45 The Forgotten Topological Index of some Carbon Base Nanomaterials (Ozge¨ C¸olakoˇgluHavare)......................... 46 A construction of regular Hadamard matrices (Dean Crnkovi´c)....... 47 vi The number of P -vertices in a matrix with maximum nullity (Henrique F. da Cruz).................................. 47 On the Mathon bound for regular near hexagons (Bart De Bruyn)..... 48 The Hamilton Cycle Problem for locally traceable and locally Hamiltonian graphs (Johan de Wet).......................... 49 Recent progress on partial difference sets in Abelian groups (Stefaan De Winter).................................. 50 New results on distance spectrum of special classes of trees (Renata Del- Vecchio).................................. 50 Degree Sequences of Hypergraphs, Self-Complementary and Almost Self- Complementary 3-uniform Hypergraphs (Charusheela Deshpande).. 51 The Fibonacci numbers of the composition of graphs (Loiret A. Dosal- Trujillo).................................. 52 2-proper connection of graphs (Trung Duy Doan).............. 53 Restricted size Ramsey numbers for some graphs (Tomasz Dzido)..... 53 Toughness and treewidth (Mark Ellingham)................. 54 Navigating Between Packings of Graphic Sequences (P´eterL. Erd}os)... 54 Autotopism stabilized colouring games on rook's graphs (Ra´ulM. Falc´on) 55 Edge Construction of Molecular NSSDs (Alexander Farrugia)....... 56 Irregular independence and irregular domination (Kurt Fenech)...... 57 Existence theorems for nonnegative integral matrices with given line sums (Ros´arioFernandes)........................... 58 Elementary Derivation of the Hoffman-Singleton Graph and its Automor- phism Group (Jay Fraser)........................ 58 The fixed score tree graph (Juli´anAlberto Fres´an-Figueroa)........ 59 Hypohamiltonian and Hypotraceable Oriented Graphs (Marietjie Frick). 59 Equitable Colorings of l-Corona Products of Cubic Graphs (Hanna Furma´nczyk)............................... 60 Minimal Matrices in the Bruhat Order for Symmetric (0,1)-Matrices (Su- sana Furtado)............................... 61 Resolvable configurations (G´abor G´evay)................... 61 Sufficient conditions for the existence of alternating Hamiltonian paths and cycles in 2-edge-coloured multigraphs (Ilan A. Goldfeder)....... 62 The Edge Intersection Graphs of Paths on a Grid (Martin Charles Golumbic) 62 On the clique number of a strongly regular graph (Gary Greaves)..... 63 Maltese mathematics in the 16th and 17th century (Harald Gropp)..... 64 Orbital matrices and configurations with natural index (Harald Gropp).
Recommended publications
  • Interval Edge-Colorings of Graphs

    Interval Edge-Colorings of Graphs

    University of Central Florida STARS Electronic Theses and Dissertations, 2004-2019 2016 Interval Edge-Colorings of Graphs Austin Foster University of Central Florida Part of the Mathematics Commons Find similar works at: https://stars.library.ucf.edu/etd University of Central Florida Libraries http://library.ucf.edu This Masters Thesis (Open Access) is brought to you for free and open access by STARS. It has been accepted for inclusion in Electronic Theses and Dissertations, 2004-2019 by an authorized administrator of STARS. For more information, please contact [email protected]. STARS Citation Foster, Austin, "Interval Edge-Colorings of Graphs" (2016). Electronic Theses and Dissertations, 2004-2019. 5133. https://stars.library.ucf.edu/etd/5133 INTERVAL EDGE-COLORINGS OF GRAPHS by AUSTIN JAMES FOSTER B.S. University of Central Florida, 2015 A thesis submitted in partial fulfilment of the requirements for the degree of Master of Science in the Department of Mathematics in the College of Sciences at the University of Central Florida Orlando, Florida Summer Term 2016 Major Professor: Zixia Song ABSTRACT A proper edge-coloring of a graph G by positive integers is called an interval edge-coloring if the colors assigned to the edges incident to any vertex in G are consecutive (i.e., those colors form an interval of integers). The notion of interval edge-colorings was first introduced by Asratian and Kamalian in 1987, motivated by the problem of finding compact school timetables. In 1992, Hansen described another scenario using interval edge-colorings to schedule parent-teacher con- ferences so that every person’s conferences occur in consecutive slots.
  • Uniform Factorizations of Graphs

    Uniform Factorizations of Graphs

    Western Michigan University ScholarWorks at WMU Dissertations Graduate College 12-1979 Uniform Factorizations of Graphs David Burns Western Michigan University Follow this and additional works at: https://scholarworks.wmich.edu/dissertations Part of the Mathematics Commons Recommended Citation Burns, David, "Uniform Factorizations of Graphs" (1979). Dissertations. 2682. https://scholarworks.wmich.edu/dissertations/2682 This Dissertation-Open Access is brought to you for free and open access by the Graduate College at ScholarWorks at WMU. It has been accepted for inclusion in Dissertations by an authorized administrator of ScholarWorks at WMU. For more information, please contact [email protected]. UNIFORM FACTORIZATIONS OF GRAPHS by David Burns A Dissertation Submitted to the Faculty of The Graduate College in partial fulfillment of the Degree of Doctor of Philosophy Western Michigan University Kalamazoo, Michigan December 197 9 Reproduced with permission of the copyright owner. Further reproduction prohibited without permission. ACKNOWLEDGEMENT S I wish to thank Professor Shashichand Kapoor, my advisor, for his guidance and encouragement during the writing of this dissertation. I would also like to thank my other working partners Professor Phillip A. Ostrand of the University of California at Santa Barbara and Professor Seymour Schuster of Carleton College for their many contributions to this study. I am also grateful to Professors Yousef Alavi, Gary Chartrand, and Dionsysios Kountanis of Western Michigan University for their careful reading of the manuscript and to Margaret Johnson for her expert typing. David Burns Reproduced with permission of the copyright owner. Further reproduction prohibited without permission. INFORMATION TO USERS This was produced from a copy of a document sent to us for microfilming.
  • Constructions and Enumeration Methods for Cubic Graphs and Trees

    Constructions and Enumeration Methods for Cubic Graphs and Trees

    Butler University Digital Commons @ Butler University Undergraduate Honors Thesis Collection Undergraduate Scholarship 2013 Constructions and Enumeration Methods for Cubic Graphs and Trees Erica R. Gilliland Butler University Follow this and additional works at: https://digitalcommons.butler.edu/ugtheses Part of the Discrete Mathematics and Combinatorics Commons Recommended Citation Gilliland, Erica R., "Constructions and Enumeration Methods for Cubic Graphs and Trees" (2013). Undergraduate Honors Thesis Collection. 360. https://digitalcommons.butler.edu/ugtheses/360 This Thesis is brought to you for free and open access by the Undergraduate Scholarship at Digital Commons @ Butler University. It has been accepted for inclusion in Undergraduate Honors Thesis Collection by an authorized administrator of Digital Commons @ Butler University. For more information, please contact [email protected]. BUTLER UNIVERSITY HONORS PROGRAM Honors Thesis Certification Please type all information in this section: Applicant Erica R. Gilliland (Name as it is to appear on diploma) Thesis title Constructions and Enumeration Methods for Cubic Graphs and Trees Intended date of commencement May 11, 2013 --~------------------------------ Read, approved, and signed by: tf -;t 'J,- J IJ Thesis adviser(s) D'rt/~ S// CWiV'-~ Date Date t.-t - 2. Z - 2.C?{3 Reader(s) Date Date Certified by Director, Honors Program Date For Honors Program use: Level of Honors conferred: University Departmental MtH1t£W1Ah"LS with ttijutt HoVJQ(5 ik1vrj,,1 r"U)U ",1-111 ttlStl HMbCS V(IIVet>i}\j HtlYlb6 froyrltm I Constructions and Enumeration Methods for Cubic Graphs and Trees Erica R. Gilliland A Thesis Presented to the Department of Mathematics College of Liberal Arts and Sciences and Honors Program of Butler University III Partial Fulfillment of the ncCIuirclllcnts for G rae! ua lion Honors Submitted: April 2:3, 2()1:3 Constructions and Enumeration Methods for Cubic Graphs and Trees Erica It Gilliland Under the supervision of Dr.
  • A Girl Recovering, but Still in Danger

    A Girl Recovering, but Still in Danger

    Thanks for the ETC.:New Smithereens album review memories... Sunny and warm today, high -I* in the 60s. Sunny Saturday, VIEWPOINT: Finals and God high of 65. i A VOL. XXI, NO. 133 FRIDAY, APRIL 29, 1988 the independent newspaper serving Notre Dame and Saint Mary's Awards given at SMC convocation By KATIE KEARNEY Mary’s community,” said and MARK MCLAUGHLIN Hickey. !tt lit* Senior Staff Reporters Awards were presented to r •»* '* students and faculty in ,..4, -#*****.*4*.*■_ ..t:.. ... _ — I” ,.*.-*s £ , Awards to graduating ceremonies at O'taughlin 4 4 4 . 1 4 4 1 4 * 4 4 » * * • * 4 f * . * t . « . 4 *fc yi ■*> »♦« • 'tM lili J I * t • • >1 * • » .' «.«. *a1 . * 4 seniors, faculty promotions, Auditorium, including medals . <> 44 1441**44 V -•»«■ • ------------------------- 1 lie k1 H I and a speech by the president to co-valedictorians Joan Bout- -0 - * • " » 14 of the College marked the ton and Gretchen Gilcrest. Honors Convocation held at Students Meghan Rafferty » 4 . <U ! * • i « |t Saint Mary’s Thursday night. and Mary Malina were each presented with National Asso­ ...» “The Honors Convocation is ciation of Intercollegiate Ath­ a chance to gather as an aca­ letics Academic All-American demic community and honor awards. Only 37 of these faculty and students alike,” awards were presented said Saint Mary’s President throughout the country. William Hickey in an address Sister Elena Malits, profes­ to the convocation audience. sor of religious studies, was “You make all of us proud to be members of the Saint see AWARDS, page 12 Girl recovering, Light up the night The Observer / David Fischer but still in danger The rough rocks of the grotto absorb the dim glow exams signal the year’s end, the grotto remains one of flickering candle flames on a dark night.
  • Matchings in Balanced Hypergraphs

    Matchings in Balanced Hypergraphs

    Matchings in balanced hypergraphs Von der Fakultat¨ fur¨ Mathematik, Informatik und Naturwissenschaften der RWTH Aachen University zur Erlangung des akademischen Grades eines Doktors der Naturwissenschaften genehmigte Dissertation vorgelegt von Diplom-Mathematiker Robert Berthold Scheidweiler aus Duren-Birkesdorf.¨ Berichter: Universitatsprofessor¨ Dr. Eberhard Triesch Universitatsprofessor¨ Dr. Arie M.C.A. Koster Tag der mundlichen¨ Prufung:¨ 19. April 2011 Diese Dissertation ist auf den Internetseiten der Hochschulbibliothek online verfugbar.¨ Danksagung In den letzten funf¨ Jahren habe ich am Lehrstuhl II fur¨ Mathematik der RWTH Aachen Uni- versity die vorliegende Dissertation verfasst. Einigen gebuhrt¨ fur¨ ihre Unterstutzung¨ und Hilfe wahrend¨ dieser Zeit besonderer Dank. Zuallererst mochte¨ ich mich bei dem Betreuer meiner Dissertation und meinem Chef, Eberhard Triesch, bedanken. Durch ihn habe ich das Thema dieser Arbeit erhalten, das mir sehr ans Herz gewachsen ist. Er hat mir bei meinen Forschungen immer mit Rat und Tat zur Seite gestanden und mich auch bei langer¨ andauern- den Durststrecken niemals unter Druck gesetzt. Seine positive Unterstutzung¨ und geduldige Hilfe haben mich motiviert, diese Arbeit zu vollenden. Weiterhin mochte¨ ich mich bei Arie Koster, meinem Zweitgutachter, bedanken. Mehrfach hat er im Verlauf meiner Promotion Anregungen gegeben, die dann in die Dissertation eingeflossen sind. Vor der endgultigen¨ Ab- gabe hat er durch seine Verbesserungsvorschlage,¨ fur¨ die ich sehr dankbar bin, zur jetzigen Form der Arbeit beigetragen. Danken mochte¨ ich außerdem Bert Randerath, der mir half, einige Startschwierigkeiten zu uberwinden,¨ als ich begann, die balancierten Hypergraphen zu erforschen. Hartmut Fuhr¨ hat sehr viel Zeit darauf verwendet, mir die harmonische Analysis naher¨ zu bringen. Seine Bemuhungen¨ haben meine Promotion weiter voran gebracht.
  • A Characterization of the Doubled Grassmann Graphs, the Doubled Odd Graphs, and the Odd Graphs by Strongly Closed Subgraphs

    A Characterization of the Doubled Grassmann Graphs, the Doubled Odd Graphs, and the Odd Graphs by Strongly Closed Subgraphs

    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Elsevier - Publisher Connector European Journal of Combinatorics 24 (2003) 161–171 www.elsevier.com/locate/ejc A characterization of the doubled Grassmann graphs, the doubled Odd graphs, and the Odd graphs by strongly closed subgraphs Akira Hiraki Division of Mathematical Sciences, Osaka Kyoiku University, 4-698-1 Asahigaoka, Kashiwara, Osaka 582-8582, Japan Received 27 November 2001; received in revised form 14 October 2002; accepted 3 December 2002 Abstract We characterize the doubled Grassmann graphs, the doubled Odd graphs, and the Odd graphs by the existence of sequences of strongly closed subgraphs. c 2003 Elsevier Science Ltd. All rights reserved. 1. Introduction Known distance-regular graphs often have many subgraphs with high regularity. For example the doubled Grassmann graphs, the doubled Odd graphs, and the Odd graphs satisfy the following condition. For any given pair (u,v) of vertices there exists a strongly closed subgraph containing them whose diameter is the distance of u and v. In particular, any ‘non- trivial’ strongly closed subgraph is distance-biregular, and that is regular iff its diameter is odd. Our purpose in this paper is to prove that a distance-regular graph with this condition is either the doubled Grassmann graph, the doubled Odd graph, or the Odd graph. First we recall our notation and terminology. All graphs considered are undirected finite graphs without loops or multiple edges. Let Γ be a connected graph with usual distance ∂Γ . We identify Γ with the set of vertices.
  • NÓMINA MPF - AGENTES CON CARGO VIGENTE Cierre: Octubre 2017

    NÓMINA MPF - AGENTES CON CARGO VIGENTE Cierre: Octubre 2017

    NÓMINA MPF - AGENTES CON CARGO VIGENTE Cierre: Octubre_2017 Apellido, Nombre Desempeño Categoría Situación Revista ABAD, FERNANDA MARIA Fiscalía en lo Civil y Comercial y Contencioso Administrativo Federal Nº 6 PROSECRETARIO ADM Efectivo ABAD, GONZALO DANIEL Fiscalía Nacional en lo Criminal y Correccional N° 45 JEFE DE DESPACHO Efectivo ABAD, IGNACIO EZEQUIEL PROCUDDHH (Procuraduría de Crímenes Contra la Humanidad) JEFE DE DESPACHO Efectivo ABAD, JUAN SEBASTIAN PROCELAC -Área Administrativa- Mesa de Entradas OFICIAL MAYOR Efectivo ABAD, MARIA SOLEDAD Fiscalía Nacional en lo Criminal y Correccional N° 36 ESCRIBIENTE Efectivo ABAL, DIEGO JUAN UFIAMIA (Unidad Fiscal para la Investigación de la Causa AMIA) SUBDIRECTOR ADJUNTO Efectivo ABAL, LEOPOLDO Fiscalía Federal de Campana ESCRIBIENTE AUXILIAR Efectivo ABALLAY, YANINA LAURA PROCELAC -Área Operativa- Fraude Económico y Bancario SECRETARIO FISC GRAL Efectivo ABALOS, MARIA CECILIA Fiscalía Federal Nº 2 de Mendoza ESCRIBIENTE Efectivo ABARCA GARCÍA, MAURO EMANUEL Secretaría de Coordinación Institucional PROSECRETARIO ADM Efectivo ABDALA, ADRIAN OMAR SGA-DLGE-SLGE-GE-Dirección y Control de Obras OFICIAL MAYOR Efectivo ABDENEVE, MONICA VIVIANA Dpto. Logística - Intendencia - Av. de Mayo 760 MEDIO OFICIAL Efectivo ABELLA, MARIA DOLORES SDTRRHH-DDT-Dirección Disciplinaria y Técnica SUBSEC LETRADO Efectivo ABELLEIRA, MABEL CRISTINA Auditoría Interna SUBSEC ADM Efectivo ABELSON, GABRIELA Fiscalía General ante la Cámara Federal de Apelaciones de San Martín SECRETARIO FISC GRAL Efectivo ABIHAGGLE,
  • Tilburg University Graphs Whose Normalized Laplacian Has Three

    Tilburg University Graphs Whose Normalized Laplacian Has Three

    Tilburg University Graphs whose normalized laplacian has three eigenvalues van Dam, E.R.; Omidi, G.R. Published in: Linear Algebra and its Applications Publication date: 2011 Document Version Peer reviewed version Link to publication in Tilburg University Research Portal Citation for published version (APA): van Dam, E. R., & Omidi, G. R. (2011). Graphs whose normalized laplacian has three eigenvalues. Linear Algebra and its Applications, 435(10), 2560-2569. General rights Copyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications that users recognise and abide by the legal requirements associated with these rights. • Users may download and print one copy of any publication from the public portal for the purpose of private study or research. • You may not further distribute the material or use it for any profit-making activity or commercial gain • You may freely distribute the URL identifying the publication in the public portal Take down policy If you believe that this document breaches copyright please contact us providing details, and we will remove access to the work immediately and investigate your claim. Download date: 29. sep. 2021 Graphs whose normalized Laplacian has three eigenvalues¤ E.R. van Dama G.R. Omidib;c;1 aTilburg University, Dept. Econometrics and Operations Research, P.O. Box 90153, 5000 LE, Tilburg, The Netherlands bDept. Mathematical Sciences, Isfahan University of Technology, Isfahan, 84156-83111, Iran cSchool of Mathematics, Institute for Research in Fundamental Sciences (IPM), P.O. Box 19395-5746, Tehran, Iran edwin:vandam@uvt:nl romidi@cc:iut:ac:ir Abstract We give a combinatorial characterization of graphs whose normalized Laplacian has three distinct eigenvalues.
  • Arxiv:2010.05518V3 [Math.CO] 28 Jan 2021 Consists of the Fibonacci Strings of Length N, N Fn = {V1v2

    Arxiv:2010.05518V3 [Math.CO] 28 Jan 2021 Consists of the Fibonacci Strings of Length N, N Fn = {V1v2

    FIBONACCI-RUN GRAPHS I: BASIC PROPERTIES OMER¨ EGECIO˘ GLU˘ AND VESNA IRSIˇ Cˇ Abstract. Among the classical models for interconnection networks are hyper- cubes and Fibonacci cubes. Fibonacci cubes are induced subgraphs of hypercubes obtained by restricting the vertex set to those binary strings which do not con- tain consecutive 1s, counted by Fibonacci numbers. Another set of binary strings which are counted by Fibonacci numbers are those with a restriction on the run- lengths. Induced subgraphs of the hypercube on the latter strings as vertices define Fibonacci-run graphs. They have the same number of vertices as Fibonacci cubes, but fewer edges and different connectivity properties. We obtain properties of Fibonacci-run graphs including the number of edges, the analogue of the fundamental recursion, the average degree of a vertex, Hamil- tonicity, and special degree sequences, the number of hypercubes they contain. A detailed study of the degree sequences of Fibonacci-run graphs is interesting in its own right and is reported in a companion paper. Keywords: Hypercube, Fibonacci cube, Fibonacci number. AMS Math. Subj. Class. (2020): 05C75, 05C30, 05C12, 05C40, 05A15 1. Introduction The n-dimensional hypercube Qn is the graph on the vertex set n f0; 1g = fv1v2 : : : vn j vi 2 f0; 1gg; where two vertices v1v2 : : : vn and u1u2 : : : un are adjacent if vi 6= ui for exactly one index i 2 [n]. In other words, vertices of Qn are all possible strings of length n consisting only of 0s and 1s, and two vertices are adjacent if and only if they differ n n−1 in exactly one coordinate or \bit".
  • Characterization of Generalized Petersen Graphs That Are Kronecker Covers Matjaž Krnc, Tomaž Pisanski

    Characterization of Generalized Petersen Graphs That Are Kronecker Covers Matjaž Krnc, Tomaž Pisanski

    Characterization of generalized Petersen graphs that are Kronecker covers Matjaž Krnc, Tomaž Pisanski To cite this version: Matjaž Krnc, Tomaž Pisanski. Characterization of generalized Petersen graphs that are Kronecker covers. 2019. hal-01804033v4 HAL Id: hal-01804033 https://hal.archives-ouvertes.fr/hal-01804033v4 Preprint submitted on 18 Oct 2019 (v4), last revised 3 Nov 2019 (v6) 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. Discrete Mathematics and Theoretical Computer Science DMTCS vol. VOL:ISS, 2015, #NUM Characterization of generalised Petersen graphs that are Kronecker covers∗ Matjazˇ Krnc1;2;3y Tomazˇ Pisanskiz 1 FAMNIT, University of Primorska, Slovenia 2 FMF, University of Ljubljana, Slovenia 3 Institute of Mathematics, Physics, and Mechanics, Slovenia received 17th June 2018, revised 20th Mar. 2019, 18th Sep. 2019, accepted 26th Sep. 2019. The family of generalised Petersen graphs G (n; k), introduced by Coxeter et al. [4] and named by Watkins (1969), is a family of cubic graphs formed by connecting the vertices of a regular polygon to the corresponding vertices of a star polygon. The Kronecker cover KC (G) of a simple undirected graph G is a special type of bipartite covering graph of G, isomorphic to the direct (tensor) product of G and K2.
  • PDF Reference

    PDF Reference

    NetworkX Reference Release 1.0 Aric Hagberg, Dan Schult, Pieter Swart January 08, 2010 CONTENTS 1 Introduction 1 1.1 Who uses NetworkX?..........................................1 1.2 The Python programming language...................................1 1.3 Free software...............................................1 1.4 Goals...................................................1 1.5 History..................................................2 2 Overview 3 2.1 NetworkX Basics.............................................3 2.2 Nodes and Edges.............................................4 3 Graph types 9 3.1 Which graph class should I use?.....................................9 3.2 Basic graph types.............................................9 4 Operators 129 4.1 Graph Manipulation........................................... 129 4.2 Node Relabeling............................................. 134 4.3 Freezing................................................. 135 5 Algorithms 137 5.1 Boundary................................................. 137 5.2 Centrality................................................. 138 5.3 Clique.................................................. 142 5.4 Clustering................................................ 145 5.5 Cores................................................... 147 5.6 Matching................................................. 148 5.7 Isomorphism............................................... 148 5.8 PageRank................................................. 161 5.9 HITS..................................................
  • Package 'Igraph'

    Package 'Igraph'

    Package ‘igraph’ February 28, 2013 Version 0.6.5-1 Date 2013-02-27 Title Network analysis and visualization Author See AUTHORS file. Maintainer Gabor Csardi <[email protected]> Description Routines for simple graphs and network analysis. igraph can handle large graphs very well and provides functions for generating random and regular graphs, graph visualization,centrality indices and much more. Depends stats Imports Matrix Suggests igraphdata, stats4, rgl, tcltk, graph, Matrix, ape, XML,jpeg, png License GPL (>= 2) URL http://igraph.sourceforge.net SystemRequirements gmp, libxml2 NeedsCompilation yes Repository CRAN Date/Publication 2013-02-28 07:57:40 R topics documented: igraph-package . .5 aging.prefatt.game . .8 alpha.centrality . 10 arpack . 11 articulation.points . 15 as.directed . 16 1 2 R topics documented: as.igraph . 18 assortativity . 19 attributes . 21 autocurve.edges . 23 barabasi.game . 24 betweenness . 26 biconnected.components . 28 bipartite.mapping . 29 bipartite.projection . 31 bonpow . 32 canonical.permutation . 34 centralization . 36 cliques . 39 closeness . 40 clusters . 42 cocitation . 43 cohesive.blocks . 44 Combining attributes . 48 communities . 51 community.to.membership . 55 compare.communities . 56 components . 57 constraint . 58 contract.vertices . 59 conversion . 60 conversion between igraph and graphNEL graphs . 62 convex.hull . 63 decompose.graph . 64 degree . 65 degree.sequence.game . 66 dendPlot . 67 dendPlot.communities . 68 dendPlot.igraphHRG . 70 diameter . 72 dominator.tree . 73 Drawing graphs . 74 dyad.census . 80 eccentricity . 81 edge.betweenness.community . 82 edge.connectivity . 84 erdos.renyi.game . 86 evcent . 87 fastgreedy.community . 89 forest.fire.game . 90 get.adjlist . 92 get.edge.ids . 93 get.incidence . 94 get.stochastic .