On super 3-restricted edge connectivity of regular strong product graphs with girth at least four
Yingying Qin, Zhiping Xiong, Jingyu Wang · 2010
It is known that communication networks with topologies being super 3-restricted edge connected graphs are more reliable under some reasonable conditions. Let Gibe maximally edge connected ki- regular graphs with ki≥ 3, i = 1,2 . It is proved in this work that if g(Gi) ≥ 4 , then the strong product G1⊗G2of graphs G1and G2is super 3 -restricted edge connected.