Cite
HARVARD Citation
Ge, G. et al. (n.d.). A Complete Solution to Spectrum Problem for Five‐Vertex Graphs with Application to Traffic Grooming in Optical Networks. Journal of combinatorial designs. 23 (6), pp. 233-273. [Online].
This is an interim version of our Electronic Legal Deposit Catalogue-eJournals and eBooks while we continue to recover from a cyber-attack.
Ge, G. et al. (n.d.). A Complete Solution to Spectrum Problem for Five‐Vertex Graphs with Application to Traffic Grooming in Optical Networks. Journal of combinatorial designs. 23 (6), pp. 233-273. [Online].