Please use this identifier to cite or link to this item: https://www.um.edu.mt/library/oar/handle/123456789/45992
Title: Links between two semisymmetric graphs on 112 vertices via association schemes
Authors: Klin, Mikhail
Lauri, Josef
Ziv-Av, Matan
Keywords: Mathematics -- Graphic methods
Algebra -- Data processing
Graph theory -- Mathematical models
Association schemes (Combinatorial analysis)
Issue Date: 2012
Publisher: Elsevier
Citation: Klin, M., Lauri, J., & Ziv-Av, M. (2012). Links between two semisymmetric graphs on 112 vertices via association schemes. Journal of Symbolic Computation, 47(10), 1175-1191.
Abstract: This paper provides a model of the use of computer algebra experimentation in algebraic graph theory. Starting from the semisymmetric cubic graph L on 112 vertices, we embed it into another semisymmetric graph N of valency 15 on the same vertex set. In order to consider systematically the links between L and N, a number of combinatorial structures are involved and related coherent configurations are investigated. In particular, the construction of the incidence double cover of directed graphs is exploited. As a natural by-product of the approach presented here, a number of new interesting (mostly non-Schurian) association schemes on 56, 112 and 120 vertices are introduced and briefly discussed. We use computer algebra system GAP (including GRAPE and nauty), as well as computer package COCO.
URI: https://www.um.edu.mt/library/oar/handle/123456789/45992
Appears in Collections:Scholarly Works - FacSciMat

Files in This Item:
File Description SizeFormat 
Links_between_two_semisymmetric_graphs_on_112_vertices_via_association_schemes_2012.pdf
  Restricted Access
365.67 kBAdobe PDFView/Open Request a copy


Items in OAR@UM are protected by copyright, with all rights reserved, unless otherwise indicated.