Neighbor connectivity of k-ary n-cubes

Tomáš Dvořák and Mei-Mei Gu

Applied Mathematics and Computation, 2020, vol. 379, issue C

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 n ≥ 1 and k ≥ 2.

Keywords: Cayley graph; hypercube; k-ary n-cube; neighbor connectivity (search for similar items in EconPapers)
Date: 2020
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S009630032030206X
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:379:y:2020:i:c:s009630032030206x

DOI: 10.1016/j.amc.2020.125237

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().