## Abstract In this paper the concepts of Hamilton cycle (HC) and Hamilton path (HP) extendability are introduced. A connected graph Ξ is __n__β__HCβextendable__ if it contains a path of length __n__ and if every such path is contained in some Hamilton cycle of Ξ. Similarly, Ξ is __weakly n__β__HPβ
On the extendability of Bi-Cayley graphs of finite abelian groups
β Scribed by Yanfeng Luo; Xing Gao
- Book ID
- 108114148
- Publisher
- Elsevier Science
- Year
- 2009
- Tongue
- English
- Weight
- 629 KB
- Volume
- 309
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Let G be a finite group, S a subset of G=f1g; and let Cay Γ°G; SΓ denote the Cayley digraph of G with respect to S: If, for any subset T of G=f1g; CayΓ°G; SΓ ffi CayΓ°G; T Γ implies that S a ΒΌ T for some a 2 AutΓ°GΓ; then S is called a CI-subset. The group G is called a CIM-group if for any minimal gene
Alspach has conjectured that any 2k-regular connected Cayley graph cay(A,S) on a finite abelian group A can be decomposed into k hamiltonian cycles. In this paper, the conjecture is shown to be true if S= {sl,sz, s3} is a minimal generating set of A with 1 Al odd, or S={sl,s& . . . . sk} is a genera
The Hamilton cycles of a graph generate a subspace of the cycle space called the Hamilton space. The Hamilton space of any connected Cayley graph on an abelian group is determined in this paper.