Skip to main content
SpringerLink
Log in

Subgroup-Chain Graphs

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract.

Starting from chains of subgroups in a group a construction for k-regular graphs is given and as an application of this construction a cubic graph of girth 20 with 6072 vertices is produced. This graph is exceptional in that, at the time of writing, it has fewest vertices for a cubic graph of this girth.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. School of Mathematics and Statistics, University of Birmingham, Edgbaston, Birmingham, B15 2TT, UK

    Christopher Parker

  2. Department of Mathematics, University of Manchester Institute of Science and Technology, P.O. Box 88, Manchester, M60 1QD, UK

    Peter Rowley

Authors
  1. Christopher Parker
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Peter Rowley
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Christopher Parker.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Parker, C., Rowley, P. Subgroup-Chain Graphs. Graphs and Combinatorics 19, 537–545 (2003). https://doi.org/10.1007/s00373-003-0532-1

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00373-003-0532-1

Search

Navigation