A Complete Solution to Spectrum Problem for Five‐Vertex Graphs with Application to Traffic Grooming in Optical Networks

DOI10.1002/jcd.21405zbMath1314.05114OpenAlexW1594236607MaRDI QIDQ5256676

Hengjia Wei, Sihuang Hu, Emre Kolotoğlu, Gennian Ge

Publication date: 19 June 2015

Published in: Journal of Combinatorial Designs (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jcd.21405

zbMATH Keywords

\(G\)-designoptical networkswavelength-division multiplexinggraph decompositiontraffic grooming

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph designs and isomorphic decomposition (05C51)

Related Items (8)

The spectrum problem for digraphs of order 4 and size 5 ⋮ Optimal Groomings with Grooming Ratios Six and Seven ⋮ Kite-group divisible packings and coverings with any minimum leave and minimum excess ⋮ Designs for graphs with six vertices and ten edges -- II ⋮ A complete solution to the spectrum problem for graphs with six vertices and up to nine edges ⋮ Unnamed Item ⋮ On decomposing the complete symmetric digraph into orientations of \(K_4 - e\) ⋮ Designs for graphs with six vertices and ten edges

Cites Work

• Optical grooming with grooming ratio nine
• Optical grooming with grooming ratio eight
• Graph designs for the eight-edge five-vertex graphs
• \(G\)-decomposition of \(K_n\), where G has four vertices or less
• Grooming in unidirectional rings: \(K_{4}-e\) designs
• Traffic grooming on the path
• Minimizing drop cost for SONET/WDM networks with ? wavelength requirements
• The Existence and Construction of (K⁵∖e)-Designs of Orders 27, 135, 162, and 216
• A survey on the existence ofG-Designs
• On the Existence of $(K_5 \setminuse)$-Designs with Application to Optical Networks
• Two new direct product‐type constructions for resolvable group‐divisible designs
• Minimizing SONET ADMs in unidirectional WDM rings with grooming ratio 3
• Minimizing SONET ADMs in Unidirectional WDM Rings with Grooming Ratio Seven
• On the existence of resolvable K₄ − e designs
• Traffic Grooming in Unidirectional Wavelength-Division Multiplexed Rings with Grooming RatioC= 6
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A Complete Solution to Spectrum Problem for Five‐Vertex Graphs with Application to Traffic Grooming in Optical Networks