1 research outputs found
Neighbor connectivity of -ary -cubes
The neighbor connectivity of a graph is the least number of vertices such
that removing their closed neighborhoods from 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 -ary -cubes for all and .Comment: 11 pages, 1 figur