13 research outputs found

    Mini-Workshop: Amalgams for Graphs and Geometries

    Get PDF
    [no abstract available

    Characterising substructures of finite projective spaces

    Get PDF

    Semisymmetric cubic graphs of twice odd order

    Full text link
    The groups which can act semisymmetrically on a cubic graph of twice odd order are determined modulo a normal subgroup which acts semiregularly on the vertices of the graph

    Problems on Polytopes, Their Groups, and Realizations

    Full text link
    The paper gives a collection of open problems on abstract polytopes that were either presented at the Polytopes Day in Calgary or motivated by discussions at the preceding Workshop on Convex and Abstract Polytopes at the Banff International Research Station in May 2005.Comment: 25 pages (Periodica Mathematica Hungarica, Special Issue on Discrete Geometry, to appear

    Edge-transitive regular Zn-covers of the Heawood graph

    Get PDF
    AbstractA regular cover of a graph is said to be an edge-transitive cover if the fibre-preserving automorphism subgroup acts edge-transitively on the covering graph. In this paper we classify edge-transitive regular Zn-covers of the Heawood graph, and obtain a new infinite family of one-regular cubic graphs. Also, as an application of the classification of edge-transitive regular Zn-covers of the Heawood graph, we prove that any bipartite edge-transitive cubic graph of order 14p is isomorphic to a normal Cayley graph of dihedral group if the prime p>13

    Implementing Brouwer's database of strongly regular graphs

    Full text link
    Andries Brouwer maintains a public database of existence results for strongly regular graphs on n1300n\leq 1300 vertices. We implemented most of the infinite families of graphs listed there in the open-source software Sagemath, as well as provided constructions of the "sporadic" cases, to obtain a graph for each set of parameters with known examples. Besides providing a convenient way to verify these existence results from the actual graphs, it also extends the database to higher values of nn.Comment: 18 pages, LaTe

    Locally arc-transitive graphs of valence {3,4}\{3,4\} with trivial edge kernel

    Full text link
    In this paper we consider connected locally GG-arc-transitive graphs with vertices of valence 3 and 4, such that the kernel Guv[1]G_{uv}^{[1]} of the action of an edge-stabiliser on the neighourhood Γ(u)Γ(v)\Gamma(u) \cup \Gamma(v) is trivial. We find nineteen finitely presented groups with the property that any such group GG is a quotient of one of these groups. As an application, we enumerate all connected locally arc-transitive graphs of valence 3,4{3,4} on at most 350 vertices whose automorphism group contains a locally arc-transitive subgroup GG with Guv[1]=1G_{uv}^{[1]} = 1

    Strongly regular graphs satisfying the 4-vertex condition

    Full text link
    We survey the area of strongly regular graphs satisfying the 4-vertex condition and find several new families. We describe a switching operation on collinearity graphs of polar spaces that produces cospectral graphs. The obtained graphs satisfy the 4-vertex condition if the original graph belongs to a symplectic polar space.Comment: 19 page
    corecore