Paired 2-disjoint path covers of burnt pancake graphs with faulty elements

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

Result language
angličtina
Original language name
Paired 2-disjoint path covers of burnt pancake graphs with faulty elements
Original language description
The burnt pancake graph BPn is the Cayley graph of the hyperoctahedral group using prefix reversals as generators. Let {u,v} and {x,y} be any two pairs of distinct vertices of BPn for n>=4. We show that there are u-v and x-y paths whose vertices partition the vertex set of BPn even if BPn has up to n-4 faulty elements. On the other hand, for every n>=3 there is a set of n-2 faulty edges or faulty vertices for which such a fault-free disjoint path cover does not exist.
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
2024
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)