Designs for graphs with six vertices and ten edges - II
Open Access
- 29 December 2022
- journal article
- research article
- Published by University of Calgary in Contributions to Discrete Mathematics
- Vol. 17 (2) , 112-136
Abstract
The design spectrum has been determined for ten of the 15 graphs with six vertices and ten edges. In this paper, we solve the design spectrum problem for the remaining five graphs with three possible exceptions.Keywords
This publication has 5 references indexed in Scilit:
- A Complete Solution to Spectrum Problem for Five‐Vertex Graphs with Application to Traffic Grooming in Optical NetworksJournal of Combinatorial Designs, 2014
- On the Existence of $(K_5 \setminuse)$-Designs with Application to Optical NetworksSIAM Journal on Discrete Mathematics, 2008
- An Atlas Of Graphs1998
- Group divisible designs with block-size fourDiscrete Mathematics, 1977
- The Existence and Construction of Balanced Incomplete Block DesignsThe Annals of Mathematical Statistics, 1961