Location of Repository

A Hamiltonian cycle in a connected graph <em>G</em> is defined as a closed walk that traverses every vertex of <em>G</em> exactly once, except the starting vertex at which the walk also terminates. If an edge from a Hamiltonian cycle is removed, it forms a path calleda Hamiltonian path. A graph <em>G</em> is called Hamiltonian if there is a Hamiltonian cyclein <em>G</em>. It is known that every hypercube graph is Hamiltonian. But when one or more vertices are removed from a hypercube graph, will it still be Hamiltonian? Some induced subgraphs of a hypercube graph such as the Fibonacci cube (FC), the extended Fibonaccicube (EFC), and the Lucas cube (LC) have been introduced and their Hamiltonicities have been investigated. Research results showed that less than a third of FC graphs are Hamiltonian although all of them have Hamiltonian path. All EFC graphs are Hamiltonian and none of LC graphs is Hamiltonian although some still have Hamiltonian paths.This paper introduces another subgraph of a hypercube graph called the Extended Lucas Cube (ELC). The ELC is shown to be Hamiltonian by using the approach of k-Gray Code and Bipartition Property

Topics:
String biner, hypercube, extended Fibonacci cube, jarak Hamming, k-kode gray, Hamiltonian, sikul Hamiltonian, bipartisi, Mathematics, QA1-939

Publisher: Indonesian Mathematical Society

Year: 2012

OAI identifier:
oai:doaj.org/article:e09108d4044447a9947ce2cff0f58060

Provided by:
Directory of Open Access Journals (new)

Download PDF:To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.