AbstractIt is proved that there exists a path Pl(x,y) of length l if dAQn(x,y)≤l≤2n−1 between any two distinct vertices x and y of AQn. Obviously, we expect that such a path Pl(x,y) can be further extended by including the vertices not in Pl(x,y) into a hamiltonian path from x to a fixed vertex z or a hamiltonian cycle. In this paper, we prove that there exists a hamiltonian path R(x,y,z;l) from x to z such that dR(x,y,z;l)(x,y)=l for any three distinct vertices x, y, and z of AQn with n≥2 and for any dAQn(x,y)≤l≤2n−1−dAQn(y,z). Furthermore, there exists a hamiltonian cycle S(x,y;l) such that dS(x,y;l)(x,y)=l for any two distinct vertices x and y and for any dAQn(x,y)≤l≤2n−1
Copyright © 2014 M. Sohel Rahman et al. This is an open access article distributed under the Creativ...
AbstractA graph G is called uniquely hamiltonian-connected from a vertex ν of G if G contains exactl...
For distinct vertices u and ν of a nontrivial connected graph G, the detour distance D(u, ν) between...
AbstractIt is proved that there exists a path Pl(x,y) of length l if dAQn(x,y)≤l≤2n−1 between any tw...
Abstract — A bipartite graph is hamiltonian laceable if there exists a hamiltonian path between any ...
AbstractA hamiltonian square-path (-cycle) is one obtained from a hamiltonian path (cycle) by joinin...
A Hamiltonian path is a spanning path in a graph i.e. a path through every vertex. In this paper we ...
AbstractGiven a set P of at most 2n-4 prescribed edges (n⩾5) and vertices u and v whose mutual dista...
[[abstract]]A Hamiltonian graph G is panpositionably Hamiltonian if for any two distinct vertices x ...
[[abstract]]A Hamiltonian graph G is panpositionably Hamiltonian if for any two distinct vertices x ...
AbstractLet B be a block (finite connected graph without cut-vertices) with at least four vertices a...
We prove that if P is a set of at most 2n − 1 edges in a k-ary n-cube, where k ≥ 4 and n ≥ 2, then t...
[[abstract]]A Hamiltonian graph G is said to be panpositionably Hamiltonian if, for any two distin...
Let U be the set of cubic planar hamiltonian graphs, A the set of graphs G in U such that G − v is h...
AbstractA graph G is called uniquely hamiltonian-connected from a vertex v if there is a unique v−x ...
Copyright © 2014 M. Sohel Rahman et al. This is an open access article distributed under the Creativ...
AbstractA graph G is called uniquely hamiltonian-connected from a vertex ν of G if G contains exactl...
For distinct vertices u and ν of a nontrivial connected graph G, the detour distance D(u, ν) between...
AbstractIt is proved that there exists a path Pl(x,y) of length l if dAQn(x,y)≤l≤2n−1 between any tw...
Abstract — A bipartite graph is hamiltonian laceable if there exists a hamiltonian path between any ...
AbstractA hamiltonian square-path (-cycle) is one obtained from a hamiltonian path (cycle) by joinin...
A Hamiltonian path is a spanning path in a graph i.e. a path through every vertex. In this paper we ...
AbstractGiven a set P of at most 2n-4 prescribed edges (n⩾5) and vertices u and v whose mutual dista...
[[abstract]]A Hamiltonian graph G is panpositionably Hamiltonian if for any two distinct vertices x ...
[[abstract]]A Hamiltonian graph G is panpositionably Hamiltonian if for any two distinct vertices x ...
AbstractLet B be a block (finite connected graph without cut-vertices) with at least four vertices a...
We prove that if P is a set of at most 2n − 1 edges in a k-ary n-cube, where k ≥ 4 and n ≥ 2, then t...
[[abstract]]A Hamiltonian graph G is said to be panpositionably Hamiltonian if, for any two distin...
Let U be the set of cubic planar hamiltonian graphs, A the set of graphs G in U such that G − v is h...
AbstractA graph G is called uniquely hamiltonian-connected from a vertex v if there is a unique v−x ...
Copyright © 2014 M. Sohel Rahman et al. This is an open access article distributed under the Creativ...
AbstractA graph G is called uniquely hamiltonian-connected from a vertex ν of G if G contains exactl...
For distinct vertices u and ν of a nontrivial connected graph G, the detour distance D(u, ν) between...