On the Existence of $(K_5 \setminuse)$-Designs with Application to Optical Networks

DOI10.1137/060660084zbMath1151.05309MaRDI QIDQ3544239

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

zbMATH Keywords

optical networks; graph decompositions; traffic grooming; \((K_5 \setminus e)\)-design

Mathematics Subject Classification ID

68M10: Network design and communication in computer systems

05B05: Combinatorial aspects of block designs

68R05: Combinatorics in computer science

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

Related Items

Designs for graphs with six vertices and ten edges, Designs for graphs with six vertices and ten edges -- II, Unnamed Item, A Complete Solution to Spectrum Problem for Five‐Vertex Graphs with Application to Traffic Grooming in Optical Networks, Optical grooming with grooming ratio nine, Optical grooming with grooming ratio eight, Graph designs for the eight-edge five-vertex graphs, On the non-existence of pair covering designs with at least as many points as blocks, The Existence and Construction of (K⁵∖e)-Designs of Orders 27, 135, 162, and 216, Degree- and Orbit-Balanced Γ-Designs When Γ Has Five Vertices, Optimal Groomings with Grooming Ratios Six and Seven