Locating Pairs of Vertices on a Hamiltonian Cycle in Bigraphs |
| |
Authors: | Ralph J. Faudree Jeno Lehel Kiyoshi Yoshimoto |
| |
Affiliation: | 1.The University of Memphis,Memphis,USA;2.Alfréd Rényi Institute of Mathematics, Hungarian Academy of Sciences,Budapest,Hungary;3.Nihon University,Tokyo,Japan |
| |
Abstract: | Let G be a simple (mtimes m) bipartite graph with minimum degree (delta (G)ge m/2+1). We prove that for every pair of vertices x, y, there is a Hamiltonian cycle in G such that the distance between x and y along that cycle equals k, where (2le k is an integer having appropriate parity. We conjecture that this is also true up to (kle m). |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|