Graph designs for the eight-edge five-vertex graphs

DOI10.1016/j.disc.2008.10.015zbMath1193.05046OpenAlexW2059556413MaRDI QIDQ1045180

Alan C. H. Ling, Charles J. Colbourn, Gennian Ge

Publication date: 15 December 2009

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

Full work available at URL: https://doi.org/10.1016/j.disc.2008.10.015

zbMATH Keywords

decompositiongraph designs\(G_{20}\)-designs\(G_{21}\)-designs

Mathematics Subject Classification ID

Other designs, configurations (05B30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (5)

A survey on the existence ofG-Designs ⋮ Optical grooming with grooming ratio eight ⋮ Decomposition of complete graphs into connected unicyclic bipartite graphs with eight 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

Cites Work

• Minimizing drop cost for SONET/WDM networks with ? wavelength requirements
• A survey on the existence ofG-Designs
• On the Existence of $(K_5 \setminuse)$-Designs with Application to Optical Networks
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Graph designs for the eight-edge five-vertex graphs