On DRC-covering ofλ-fold complete graphs

DOI10.1080/09720529.2013.778472zbMath1348.05162OpenAlexW2022878855MaRDI QIDQ2831817

Na Han, Zhi-He Liang

Publication date: 3 November 2016

Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/09720529.2013.778472

zbMATH Keywords

cyclecomplete graphWDM networkDRC-covering

Mathematics Subject Classification ID

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

Cites Work

• A global approach for designing reliable WDM networks and grooming the traffic
• On DRC‐covering of K_n by cycles

This page was built for publication: On DRC-covering ofλ-fold complete graphs