Fault Diameter of Strong Product Graph of Two Paths

Strong product is an efficient method to construct large networks from small networks. Fault diameter is an important parameter to measure the fault tolerance and effectiveness of interconnection networks. In this paper, we first determine the vertex fault diameter of the strong product graph of two paths by constructing the internally vertex-disjoint paths between any two vertices in the graph, then we determine the edge fault diameter of the strong product graph of two paths by constructing the edge-disjoint paths between any two vertices in the graph. In addition, we propose an improved mesh network, whose model composed of strong product graph of two paths and has many excellent characteristics.