Designs for graphs with six vertices and ten edges

<p>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.</p>

Bibliographic Details
Main Authors: A. D. Forbes, T. S. Griggs, K. A. Forbes
Format: Article
Language:English
Published: Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia 2019-10-01
Series:Electronic Journal of Graph Theory and Applications
Subjects:
Online Access:https://www.ejgta.org/index.php/ejgta/article/view/543
_version_ 1828781794146648064
author A. D. Forbes
T. S. Griggs
K. A. Forbes
author_facet A. D. Forbes
T. S. Griggs
K. A. Forbes
author_sort A. D. Forbes
collection DOAJ
description <p>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.</p>
first_indexed 2024-12-11T17:38:42Z
format Article
id doaj.art-b157466e5ea14d54ab78ae24dacf84b4
institution Directory Open Access Journal
issn 2338-2287
language English
last_indexed 2024-12-11T17:38:42Z
publishDate 2019-10-01
publisher Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia
record_format Article
series Electronic Journal of Graph Theory and Applications
spelling doaj.art-b157466e5ea14d54ab78ae24dacf84b42022-12-22T00:56:35ZengIndonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), IndonesiaElectronic Journal of Graph Theory and Applications2338-22872019-10-017238341010.5614/ejgta.2019.7.2.14160Designs for graphs with six vertices and ten edgesA. D. Forbes0T. S. Griggs1K. A. Forbes2School of Mathematics and Statistics, The Open University, Walton Hall, Milton Keynes MK7 6AA, UKSchool of Mathematics and Statistics, The Open University, Walton Hall, Milton Keynes MK7 6AA, UKResearch, Business and Innovation, Kingston University, Penrhyn Road, Kingston upon Thames, KT1 2EE, UK<p>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.</p>https://www.ejgta.org/index.php/ejgta/article/view/543graph design, group divisible design, wilson's construction
spellingShingle A. D. Forbes
T. S. Griggs
K. A. Forbes
Designs for graphs with six vertices and ten edges
Electronic Journal of Graph Theory and Applications
graph design, group divisible design, wilson's construction
title Designs for graphs with six vertices and ten edges
title_full Designs for graphs with six vertices and ten edges
title_fullStr Designs for graphs with six vertices and ten edges
title_full_unstemmed Designs for graphs with six vertices and ten edges
title_short Designs for graphs with six vertices and ten edges
title_sort designs for graphs with six vertices and ten edges
topic graph design, group divisible design, wilson's construction
url https://www.ejgta.org/index.php/ejgta/article/view/543
work_keys_str_mv AT adforbes designsforgraphswithsixverticesandtenedges
AT tsgriggs designsforgraphswithsixverticesandtenedges
AT kaforbes designsforgraphswithsixverticesandtenedges