On DRC-covering of -fold complete graphs

DOI10.1080/09720529.2013.778472MaRDI QIDQ2831817zbMATH OpenOpenAlexFDO

Authors Na Han, Zhihe Liang

Publication date 3 November 2016

Published in Journal of Discrete Mathematical Sciences \& 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)

Recommendations

• On DRC covering -- a survey
• On DRC‐covering of K_n by cycles
• scientific article; zbMATH DE number 1208730
• Optimal packings and coverings of \(\lambda\)DK\(_v\)
• Packings and coverings of the complete directed multigraph with 3- and 4-circuits

Cites work

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

Cited in

(2)

• On DRC‐covering of K_n by cycles
• On DRC covering -- a survey

This page was built for publication: On DRC-covering of \(\lambda\)-fold complete graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2831817)