The globally bi-\(3^*\) and hyper bi-\(3^*\) connectedness of the spider web networks (Q2572044)

The authors study the spider web networks \(\text{SW}(m,n)\) (\(m\) and \(n\) are even integers with \(m\geq 4\)) introduced by themselves [Appl. Math. Comput. 160, 269--282 (2005; Zbl 1057.05052)] as a variation of the honeycomb rectangular mesh of \textit{I. Stojmenovic} [IEEE Trans. Parallel Distrib. Syst. 8, 1036--1042 (1997)]. These networks are 3-regular bipartite graphs. In this paper a recursive property of \(\text{SW}(m,n)\) is observed. The main result says that \(\text{SW}(m,n)\) with bipartition \((V_1,V_2)\) is globally bi-3*-connected (for any two vertices \(x\in V_1\) and \(y\in V_2\) there are three internally disjoint \(x\)-\(y\) paths including all vertices) and hyper bi-3*-connected (for any three vertices \(x\), \(y\) and \(z\) of the same partite set there are three internally disjoint \(x\)-\(y\) paths avoiding \(z\) and including all the other vertices). These properties imply certain Hamiltonicity results.