Back to Search
Start Over
Matchings extend to Hamiltonian cycles in hypercubes with faulty edges.
- Source :
-
Frontiers of Mathematics in China . Dec2019, Vol. 14 Issue 6, p1117-1132. 16p. - Publication Year :
- 2019
-
Abstract
- We consider the problem of existence of a Hamiltonian cycle containing a matching and avoiding some edges in an n-cube Qn; and obtain the following results. Let n ⩾ 3; M ⊂ E(Qn); and F ⊂ E(Qn)M with 1 ⩽ |F| ⩽ 2n − 4 − |M|: If M is a matching and every vertex is incident with at least two edges in the graph Qn − F; then all edges of M lie on a Hamiltonian cycle in Qn − F: Moreover, if |M| = 1 or |M| = 2; then the upper bound of number of faulty edges tolerated is sharp. Our results generalize the well-known result for |M| = 1 [ABSTRACT FROM AUTHOR]
- Subjects :
- *HAMILTONIAN graph theory
*EDGES (Geometry)
*FAULT tolerance (Engineering)
Subjects
Details
- Language :
- English
- ISSN :
- 16733452
- Volume :
- 14
- Issue :
- 6
- Database :
- Academic Search Index
- Journal :
- Frontiers of Mathematics in China
- Publication Type :
- Academic Journal
- Accession number :
- 141078157
- Full Text :
- https://doi.org/10.1007/s11464-019-0810-8