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

DOI10.1137/060660084zbMath1151.05309OpenAlexW2090929178MaRDI 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 networksgraph decompositionstraffic grooming\((K_5 \setminus e)\)-design

Mathematics Subject Classification ID

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

Related Items (11)

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

This page was built for publication: On the Existence of $(K_5 \setminuse)$-Designs with Application to Optical Networks