Designs for graphs with six vertices and ten edges

A. D. Forbes; T. S. Griggs; K. A. Forbes

doi:10.5614/ejgta.2019.7.2.14

Electronic Journal of Graph Theory and Applications (Oct 2019)

Designs for graphs with six vertices and ten edges

A. D. Forbes,
T. S. Griggs,
K. A. Forbes

Affiliations

A. D. Forbes: School of Mathematics and Statistics, The Open University, Walton Hall, Milton Keynes MK7 6AA, UK
T. S. Griggs: School of Mathematics and Statistics, The Open University, Walton Hall, Milton Keynes MK7 6AA, UK
K. A. Forbes: Research, Business and Innovation, Kingston University, Penrhyn Road, Kingston upon Thames, KT1 2EE, UK

DOI: https://doi.org/10.5614/ejgta.2019.7.2.14
Journal volume & issue: Vol. 7, no. 2
pp. 383 – 410

Abstract

Read online

The design spectrum has been determined for two of the 15 graphs with six vertices and ten edges. In this paper we completely solve the design spectrum problem for a further eight of these graphs.

graph design, group divisible design, wilson's construction

Published in Electronic Journal of Graph Theory and Applications

ISSN: 2338-2287 (Print)
Publisher: Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia
Country of publisher: Indonesia
LCC subjects: Science: Mathematics
Website: http://www.ejgta.org/

About the journal

Abstract

Keywords