Neighbor connectivity of k-ary n-cubes

From MaRDI portal
Publication:2180667




Abstract: The neighbor connectivity of a graph G is the least number of vertices such that removing their closed neighborhoods from G results in a graph that is disconnected, complete or empty. If a~graph is used to model the topology of an interconnection network, this means that the failure of a network node causes failures of all its neighbors. We completely determine the neighbor connectivity of k-ary n-cubes for all nge1 and kge2.









This page was built for publication: Neighbor connectivity of \(k\)-ary \(n\)-cubes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2180667)