scientific article; zbMATH DE number 6857389
From MaRDI portal
Publication:5374227
zbMath1383.05202MaRDI QIDQ5374227
Anthony D. Forbes, Terry S. Griggs
Publication date: 10 April 2018
Full work available at URL: http://ajc.maths.uq.edu.au/pdf/70/ajc_v70_p052.pdf
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (4)
Designs for graphs with six vertices and ten edges -- II ⋮ A complete solution to the spectrum problem for graphs with six vertices and up to nine edges ⋮ Unnamed Item ⋮ Designs for graphs with six vertices and ten edges
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Group divisible designs with block size four and group type \(g^um^1\)
- Group divisible designs with block-size four
- On group-divisible designs with block size four and group-type \(6^{u} m^{1}\).
- Group divisible designs with block size four and group type \(g^{u} m^{1}\) for small \(g\)
- The Existence and Construction of (K5∖e)-Designs of Orders 27, 135, 162, and 216
- A survey on the existence ofG-Designs
- On the Existence of $(K_5 \setminuse)$-Designs with Application to Optical Networks
- On the spectrum for Km+2 \ Km designs
- Asymptotic results on the existence of 4‐RGDDs and uniform 5‐GDDs
- A Complete Solution to Spectrum Problem for Five‐Vertex Graphs with Application to Traffic Grooming in Optical Networks
- The Coarseness of the Complete Graph
This page was built for publication:
