首先证明在n维星图Sn中,当n≥3时如果存在点集S∪→V(Sn)|S|=n-1使得Sn-S是非连通的,那么存在点v∈V(Sn),N(v)=S。进而证明当n≥3时,n+1维星图Sn+1是强n-可诊断的。即在星图系统中所有的错误点不都是某一个点口的邻点集N(v)时,n维星图Sn的限制性诊断度为n。
This paper first shows that in an n-dimensional star graph Sn where n ≥ 3, for each vertices S ∪→ V(Sn ), |S| = n - 1, if Sn-S is disconnected, there exists a vertex v ∈ V(Sn) such that N(v) = S. Then it proves that the strong diagnosability of an n + 1 -dimensional star graph Sn + 1 is n, which is to say when all the neighboring vertices N(v) of a vertex v are not faulty simultaneously, the conditional diagnosability of an n-dimensional star graph Sn is n.