Anthony D. Forbes, Terry S. Griggs
Abstract
Open-access reader
The design spectrum has been determined for eleven of the 21 graphs with six vertices and nine edges. In this paper we completely solve the design spectrum problem for the remaining ten graphs.
OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
The design spectrum has been determined for eleven of the 21 graphs with six vertices and nine edges. In this paper we completely solve the design spectrum problem for the remaining ten graphs.
Key concepts: Combinatorics, Computer science, Mathematics