Jing, Xiaofei; Lin, Shangwei The fault tolerance of \(k\)-ary \(n\)-cubes with respect to maximally local connectivity. (Chinese. English summary) Zbl 1438.05150 J. Yunnan Minzu Univ., Nat. Sci. 27, No. 6, 479-482 (2018). Summary: The \(k\)-ary \(n\)-cube becomes one of the most common interconnection networks for multiprocessor systems because of its good topological property and special structure. The local connectivity of a graph is an important measure for network reliability. Using the local connectivity as the reliability indicator, the maximally local connected graphs are a class of the most reliable networks. It is proved that the \(k\)-ary \(n\)-cube with up to \(2n - 2\) faulty vertices is still maximally local connected. MSC: 05C40 Connectivity Keywords:\(k\)-ary \(n\)-cube; maximally local connectivity; fault tolerance PDFBibTeX XMLCite \textit{X. Jing} and \textit{S. Lin}, J. Yunnan Minzu Univ., Nat. Sci. 27, No. 6, 479--482 (2018; Zbl 1438.05150) Full Text: DOI