Fault-tolerant routing in circulant networks and cycle prefix networks

Fault-diameter of Cartesian graph bundles

“…Since nodes of a network do not always work, if some nodes are faulty, some information may not be transmitted by some of these nodes. The fault diameter has been determined for many important networks recently [3,4,8,12]. The concept of fault diameter of Cartesian product graphs was first described in [7], but the upper bound was wrong, as shown by Xu et al [12] who corrected the mistake.…”

Edge, vertex and mixed fault diameters

“…A lot of work has been done on various aspects of network fault tolerance, see for example the survey [6] and more recent papers [9,13,15]. In particular the fault diameter with faulty vertices which was first studied in [11] and the edge fault diameter has been determined for many important networks recently [8,7,12,14]. In most papers either only edge faults or only vertex faults are considered, while the case when both edges and vertices may be faulty is studied rarely.…”

Fault diameter of Cartesian product graphs

“…The fault diameter of many well-known networks have been determined by several researchers, see, for example, [4][5][6][7][8]. The concept of fault diameter was first proposed by Krishnamoorthy and Krishnamurthy [6] who gave…”