Skip to main content
SpringerLink
Log in

Symmetric Graph Designs

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract.

We introduce the notion of a symmetric graph design which is a common generalization of symmetric BIBDs and of orthogonal double covers.

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.  Universität Rostock, Rostock, Germany, , , , , , DE

    H.-D.O.F. Gronau

  2.  University of Waterloo, Ontario, Canada, , , , , , CA

    R.C. Mullin & P.J. Schellenberg

  3.  Department of Mathematics and Statistics, McMaster University, 1280 Main Street West, Hamilton, Ontario, Canada L8S 4K1. e-mail: rosa@mcmaster.ca, , , , , , CA

    A. Rosa

Authors
  1. H.-D.O.F. Gronau
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. R.C. Mullin
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. A. Rosa
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. P.J. Schellenberg
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Revised: January 21, 1999

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gronau, HD., Mullin, R., Rosa, A. et al. Symmetric Graph Designs. Graphs Comb 16, 93–102 (2000). https://doi.org/10.1007/s003730050006

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s003730050006

Keywords

Search

Navigation