Reliability Evaluation of Augmented Cubes on Degree

Abstract

The [Formula: see text]-dimensional augmented cube [Formula: see text], proposed by Choudum and Sunitha in 2002, is one of the most famous interconnection networks of the distributed parallel system. Reliability evaluation of underlying topological structures is vital for fault tolerance analysis of this system. As one of the most extensively studied parameters, the [Formula: see text]-conditional edge-connectivity of a connected graph [Formula: see text], [Formula: see text], is defined as the minimum number of the cardinality of the edge-cut of [Formula: see text], if exists, whose removal disconnects this graph and keeps each component of [Formula: see text] having minimum degree at least [Formula: see text]. Let [Formula: see text], [Formula: see text] and [Formula: see text] be three integers, where [Formula: see text], if [Formula: see text] and [Formula: see text], if [Formula: see text]. In this paper, we determine the exact value of the [Formula: see text]-conditional edge-connectivity of [Formula: see text], [Formula: see text] for each positive integer [Formula: see text] and [Formula: see text], and give an affirmative answer to Shinde and Borse’s corresponding conjecture on this topic in [On edge-fault tolerance in augmented cubes, J. Interconnection Netw. 20(4) (2020), DOI:10.1142/S0219265920500139].