Neighbor connectivity of k-ary n-cubes

From MaRDI portal
Publication:2180667

DOI10.1016/J.AMC.2020.125237zbMATH Open1460.05099arXiv1910.12364OpenAlexW3017184626MaRDI QIDQ2180667FDOQ2180667


Authors: Tomáš Dvořák, Mei-Mei Gu Edit this on Wikidata


Publication date: 14 May 2020

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/1910.12364




Recommendations




Cites Work


Cited In (5)





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)