On the Existence of (K₅ \setminuse)-Designs with Application to Optical Networks

DOI10.1137/060660084zbMATH Open1151.05309OpenAlexW2090929178MaRDI QIDQ3544239FDOQ3544239

Gennian Ge, Alan C. H. Ling

Publication date: 5 December 2008

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/060660084

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,\lambda)\)-family of Bhaskar Rao designs
• E-optimal 2^ksaturated 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

zbMATH Keywords

graph decompositionsoptical networkstraffic grooming\((K_5 \setminus e)\)-design

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Combinatorial aspects of block designs (05B05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Network design and communication in computer systems (68M10)

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
• Title not available (Why is that?)
• Optical grooming with grooming ratio nine
• Degree- and orbit-balanced \(\Gamma \)-designs when \(\Gamma \) 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)