Fault tolerance and diagnosability of burnt pancake networks under the comparison model

• Algebraic and combinatorial properties of burnt pancake networks are established.
• The structural vulnerability as well as super and extra connectivities are explored.
• The classic and conditional diagnosabilities under the comparison model are derived.

Processor fault diagnosis plays an important role in measuring the reliability of a multiprocessor system, and the diagnosabilities of many well-known multiprocessor systems have been investigated. The conditional diagnosability has been widely accepted as a new measure of diagnosability by assuming an additional condition that any faulty set can't contain all the neighbors of any node in a multiprocessor system. In this paper, we explore algebraic and combinatorial properties of burnt pancake networks, and investigate the structural vulnerability as well as super and extra connectivities. Furthermore, we show that the classic diagnosability and the conditional diagnosability of n  -dimensional burnt pancake network BPnBPn (n≥4n≥4) are n   and 3n−43n−4, respectively.