A Class 3-tight Double-loop Networks Infinite Family
Zhu Min · Jiangxi kexue · 2007
The problem of finding optimal diameter double network with a fixed number of vertices has been widely studied by grapy theory and computer science researchers.Although most double loop networks are tight for infinite values of interger N,still some of them can not be tight.The paper gives a class 3-tight optimal double loop network infinite families.