Neighbor connectivity of k-ary n-cubes

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F20%3A10420745" target="_blank" >RIV/00216208:11320/20:10420745 - isvavai.cz</a>
Result on the web
<a href="https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=W7dtRDXKDT" target="_blank" >https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=W7dtRDXKDT</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.amc.2020.125237" target="_blank" >10.1016/j.amc.2020.125237</a>

Result language
angličtina
Original language name
Neighbor connectivity of k-ary n-cubes
Original language description
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.
Czech name
—
Czech description
—

Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project
<a href="/en/project/GA19-08554S" target="_blank" >GA19-08554S: Structures and algorithms in highly symmetric graphs</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2020
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)