The Tightly Super 2-extra Connectivity and 2-extra Diagnosability of Locally Twisted Cubes
Connectivity plays an important role in measuring the fault tolerance of an interconnection network [Formula: see text]. A faulty set [Formula: see text] is called a g-extra faulty set if every component of G − F has more than g nodes. A g-extra cut of G is a g-extra faulty set F such that G − F is disconnected. The minimum cardinality of g-extra cuts is said to be the g-extra connectivity of G. G is super g-extra connected if every minimum g-extra cut F of G isolates one connected subgraph of order g + 1. If, in addition, G − F has two components, one of which is the connected subgraph of order g + 1, then G is tightly [Formula: see text] super g-extra connected. Diagnosability is an important metric for measuring the reliability of G. A new measure for fault diagnosis of G restrains that every fault-free component has at least (g + 1) fault-free nodes, which is called the g-extra diagnosability of G. The locally twisted cube LTQ n is applied widely. In this paper, it is proved that LTQ n is tightly (3n − 5) super 2-extra connected for [Formula: see text], and the 2-extra diagnosability of LTQ n is 3n − 3 under the PMC model ([Formula: see text]) and MM * model ([Formula: see text]).