Long paths and cycles in hypercubes with faulty vertices
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F09%3A00206706" target="_blank" >RIV/00216208:11320/09:00206706 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Long paths and cycles in hypercubes with faulty vertices
Original language description
We show that for every set of at most 2n - 4 faulty vertices in n-dimension hypercube and every two fault-free vertices u and v satisfying a simple necessary condition on neighbors of u and v, there exists a long fault-free path between u and v.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2009
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Information Sciences
ISSN
0020-0255
e-ISSN
—
Volume of the periodical
179
Issue of the periodical within the volume
20
Country of publishing house
US - UNITED STATES
Number of pages
11
Pages from-to
—
UT code for WoS article
000269429100011
EID of the result in the Scopus database
—