Symmetric Graph Designs

Abstract.

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

Similar content being viewed by others

Maximal arcs and quasi-symmetric designs

Article 25 March 2015

On Symmetric Designs and Binary 3-Frameproof Codes

Chapter © 2015

Almost designs and their links with balanced incomplete block designs

Article 02 January 2019

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: March 2000

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

Keywords

• Double Cover
• Graph Design
• Common Generalization
• Symmetric Graph
• Symmetric BIBDs