𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Partitions of Faulty Hypercubes into Paths with Prescribed Endvertices

✍ Scribed by Dvořák, Tomáš; Gregor, Petr

Book ID
118197658
Publisher
Society for Industrial and Applied Mathematics
Year
2008
Tongue
English
Weight
276 KB
Volume
22
Category
Article
ISSN
0895-4801

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Partitions of a graph into paths with pr
Partitions of a graph into paths with prescribed endvertices and lengths
✍ Hikoe Enomoto; Katsuhiro Ota 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 95 KB 👁 3 views

For a graph G, let ' 2 (G ) denote the minimum degree sum of a pair of nonadjacent vertices. We conjecture that if |V(G)| n i 1 k a i and ' 2 (G ) ! n k À 1, then for any k vertices v 1 , v 2 , F F F , v k in G, there exist vertex-disjoint paths P 1 , P 2 , F F F , P k such that |V (P i )| a i and v

Embedding paths of variable lengths into
Embedding paths of variable lengths into hypercubes with conditional link-faults
✍ Tz-Liang Kueng; Cheng-Kuan Lin; Tyne Liang; Jimmy J.M. Tan; Lih-Hsing Hsu 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 432 KB

Faults in a network may take various forms such as hardware failures while a node or a link stops functioning, software errors, or even missing of transmitted packets. In this paper, we study the link-fault-tolerant capability of an n-dimensional hypercube (n-cube for short) with respect to path emb

Hamiltonian cycles and paths with a pres
Hamiltonian cycles and paths with a prescribed set of edges in hypercubes and dense sets
✍ Rostislav Caha; V. Koubek 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 275 KB 👁 1 views

## Abstract This paper studies techniques of finding hamiltonian paths and cycles in hypercubes and dense sets of hypercubes. This problem is, in general, easily solvable but here the problem was modified by the requirement that a set of edges has to be used in such path or cycle. The main result o