Huang et al. [J.Parallel and Distributed Computing,62(2002),591-640] proved that TQn contains a cycle of length 2n-fv if the sum of faulty vertices and faulty edges is not more than(n-2),where fv is the number of faultyvertices.

• 如果TOn中的故障点数和故障边数之和不超过(n-2)；Huang等人[J.；Parallel andDistributed Computing；62(2002)；591-640]证明了:TQn中包含长度为2n-fv的圈；其中fv是故障点数。