The Hamiltonian path passing through prescribed edges in a star graph with faulty edges ∗
نویسندگان
چکیده
Let Fe be the set of faulty edges of Sn and E0 be the edge set of some pairwise vertex-disjoint paths of Sn. In [5], the authors showed that E0 lies on a Hamiltonian path P (u, v) of Sn−Fe where d(u, v) is odd, |Fe| ≤ n− 3, |E0| ≤ 2n− 7− 2|Fe|. In this paper we improve the previous result as follows: E0 lies on a Hamiltonian path P (u, v) of Sn − Fe where d(u, v) is odd, Fe ≤ n− 3, |E0| ≤ 2n− 6− 2|Fe|.
منابع مشابه
The Hamiltonian cycle and Hamiltonian paths passing through prescribed edges in a star graph with faulty edges
Let Fe be the set of faulty edges of Sn and E0 be the edge set of some pairwise vertex-disjoint paths of Sn. All edges of E0 lie on a Hamiltonian cycle of Sn−Fe, if |Fe| ≤ n−3, |E0| ≤ 2n−5−2|Fe| and lie on a Hamiltonian path P (u, v) where d(u, v) is odd, |Fe| ≤ n− 3, |E0| ≤ 2n− 7− 2|Fe| .
متن کاملHamiltonian cycles and paths with prescribed edges in hypercubes
The n-dimensional hypercube Qn is a graph whose vertex set consists of all binary vectors of length n, two vertices being adjacent whenever the corresponding vectors differ in exactly one coordinate. It is well-known that Qn is hamiltonian for every n ≥ 2 and the research on hamiltonian cycles satisfying certain additional properties has received a considerable attention ([7]). The applications...
متن کاملPrescribed matchings extend to Hamiltonian cycles in hypercubes with faulty edges
Ruskey and Savage asked the following question: Does every matching of Qn for n ≥ 2 extend to a Hamiltonian cycle of Qn? J. Fink showed that the question is true for every perfect matching, and solved the Kreweras’ conjecture. In this paper we consider the question in hypercubes with faulty edges. We show that every matching M of at most 2n− 1 edges can be extended to a Hamiltonian cycle of Qn ...
متن کاملLongest paths and cycles in faulty star graphs
In this paper, we investigate the star graph Sn with faulty vertices and/or edges from the graph theoretic point of view. We show that between every pair of vertices with different colors in a bicoloring of Sn, n ≥ 4, there is a fault-free path of length at least n!− 2fv − 1, and there is a path of length at least n!− 2fv − 2 joining a pair of vertices with the same color, when the number of fa...
متن کاملPaired 2-disjoint path covers and strongly Hamiltonian laceability of bipartite hypercube-like graphs
A paired many-to-many k-disjoint path cover (paired k-DPC for short) of a graph is a set of k vertex-disjoint paths joining k distinct source-sink pairs that altogether cover every vertex of the graph. We consider the problem of constructing paired 2-DPC’s in an m-dimensional bipartite HL-graph, Xm, and its application in finding the longest possible paths. It is proved that every Xm, m ≥ 4, ha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011