Let P 1 = v 1 , v 2 , v 3 , . . . , v n and P 2 = u 1 , u 2 , u 3 , . . . , u n be two hamiltonian paths of G. We say that P 1 and P 2 are independent if u 1 = v 1 , u n = v n , and u i = v i for 1 < i < n. We say a set of hamiltonian paths P 1 , P 2 , . . . , P s of G between two distinct vertices are mutually independent if any two distinct paths in the set are independent. We use n to denote the number of vertices and use e to denote the number of edges in graph G. Moreover, we useē to denote the number of edges in the complement of G. Suppose that G is a graph with e ≤ n − 4 and n ≥ 4. We prove that there are at least n − 2 −ē mutually independent hamiltonian paths between any pair of distinct vertices of G except n = 5 andē = 1. Assume that G is a graph with the degree sum of any two non-adjacent vertices being at least n + 2. Let u and v be any two distinct vertices of G. We prove that there are deg G (u) + deg G (v) − n mutually independent hamiltonian paths between u and v if (u, v) ∈ E(G) and there are deg G (u) + deg G (v) − n + 2 mutually independent hamiltonian paths between u and v if otherwise.
Definitions and notationFor the graph definition and notation we follow u, v) is an unordered pair of V }. We say that V is the vertex set and E is the * Corresponding author.
A bipartite graph G is hamiltonian laceable if there is a hamiltonian path between any two vertices of G from distinct vertex bipartite sets. A bipartite graph G is k-edge fault-tolerant hamiltonian laceable if G - F is hamiltonian laceable for every F ⊆ E(G) with |F| ≤ k. A graph G is k-edge fault-tolerant conditional hamiltonian if G - F is hamiltonian for every F ⊆ E(G) with |F| ≤ k and δ(G - F) ≥ 2. Let G0 = (V0, E0) and G1 = (V1, E1) be two disjoint graphs with |V0| = |V1|. Let Er = {(v,ɸ(v)) | v ϵ V0,ɸ(v) ϵ V1, and ɸ: V0 → V1 is a bijection}. Let G = G0 ⊕ G1 = (V0 ⋃ V1, E0 ⋃ E1 ⋃ Er). The set of n-dimensional hypercube-like graphHn is defined recursively as (a) H1 = K2, K2 is the complete graph with two vertices, and (b) if G0 and G1 are in Hn, then G = G0 ⊕ G1 is in Hn+1. Let Bn be the set of graphs G where G is bipartite and G ϵ Hn. In this paper, we show that every graph in Bn is (n - 2)-edge fault-tolerant hamiltonian laceable if n ≥ 2 and every graph in Bn is (2n - 5)-edge fault-tolerant conditional hamiltonian if n ≥ 3.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.