A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
In this paper, we deal with the graph G 0 ⊕ G 1 obtained from merging two graphs G 0 and G 1 with n vertices each by n pairwise nonadjacent edges joining vertices in G 0 and vertices in G 1 . The main problems studied are how fault-panconnectivity and fault-pancyclicity of G 0 and G 1 are translated into fault-panconnectivity and fault-pancyclicity of G 0 ⊕G 1 , respectively. Many interconnection networks such as hypercube-like interconnection networks can be represented in the form of G 0 ⊕ Gdoi:10.1016/j.tcs.2007.02.029 fatcat:axbefevrvrdodblnmr6x3wmfeq