The Open UniversitySkip to content
 

Completing the design spectra for graphs with six vertices and eight edges

Forbes, Anthony D.; Griggs, Terry S. and Forbes, Kim A. (2018). Completing the design spectra for graphs with six vertices and eight edges. Australasian Journal of Combinatorics, 70(3) pp. 386–389.

Full text available as:
[img]
Preview
PDF (Version of Record) - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
Download (63kB) | Preview
URL: https://ajc.maths.uq.edu.au/pdf/70/ajc_v70_p386.pd...
Google Scholar: Look up in Google Scholar

Abstract

Apart from two possible exceptions, the design spectrum has been determined for every graph with six vertices and at most eight edges. The purpose of this note is to establish the existence of the two missing designs, both of order 32.

Item Type: Journal Item
ISSN: 2202-3518
Academic Unit/School: Faculty of Science, Technology, Engineering and Mathematics (STEM) > Mathematics and Statistics
Faculty of Science, Technology, Engineering and Mathematics (STEM)
Item ID: 56583
Depositing User: Anthony Forbes
Date Deposited: 12 Sep 2018 15:00
Last Modified: 07 May 2019 14:30
URI: http://oro.open.ac.uk/id/eprint/56583
Share this page:

Download history for this item

These details should be considered as only a guide to the number of downloads performed manually. Algorithmic methods have been applied in an attempt to remove automated downloads from the displayed statistics but no guarantee can be made as to the accuracy of the figures.

Actions (login may be required)

Policies | Disclaimer

© The Open University   contact the OU