On the Existence of (K₅ \setminuse)-Designs with Application to Optical Networks
From MaRDI portal
(Redirected from Publication:3544239)
On the Existence of $(K 5 \setminuse)$-Designs with Application to Optical Networks
On the Existence of $(K 5 \setminuse)$-Designs with Application to Optical Networks
Recommendations
- The existence and construction of \((K_{5}\setminus e)\)-designs of orders 27, 135, 162, and 216
- \(\lambda\)-fold \(K_{2,5}\)-designs
- Existence of perfect Mendelsohn designs with \(k=5\) and \(\lambda{}>1\)
- Constructions of optimal optical orthogonal codes with weight five
- On the (v,5,)-family of Bhaskar Rao designs
- E-optimal 2ksaturated designs
- scientific article; zbMATH DE number 2226728
- On the existence of an infinite family of simple 5-designs
- A Complete Solution to Spectrum Problem for Five‐Vertex Graphs with Application to Traffic Grooming in Optical Networks
- New nonexistence results for spherical 5-designs
Cited in
(11)- Graph designs for the eight-edge five-vertex graphs
- Optimal Groomings with Grooming Ratios Six and Seven
- Designs for graphs with six vertices and ten edges
- Designs for graphs with six vertices and ten edges -- II
- A Complete Solution to Spectrum Problem for Five‐Vertex Graphs with Application to Traffic Grooming in Optical Networks
- scientific article; zbMATH DE number 6857389 (Why is no real title available?)
- Optical grooming with grooming ratio nine
- Degree- and orbit-balanced -designs when has five vertices
- Optical grooming with grooming ratio eight
- The existence and construction of \((K_{5}\setminus e)\)-designs of orders 27, 135, 162, and 216
- On the non-existence of pair covering designs with at least as many points as blocks
This page was built for publication: On the Existence of $(K_5 \setminuse)$-Designs with Application to Optical Networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3544239)
