Ernastuti ., Djati Kerami, Belawati H Widjaya


A Hamiltonian cycle in a connected graph G is defined as a closed walk that traverses every vertex of G 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 G is called Hamiltonian if there is a Hamiltonian cyclein G. 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.

DOI : http://dx.doi.org/10.22342/jims.


String biner, hypercube, extended Fibonacci cube, jarak Hamming, k-kode gray, Hamiltonian, sikul Hamiltonian, bipartisi

Full Text:


DOI: https://doi.org/10.22342/jims.


  • There are currently no refbacks.

Journal of the Indonesian Mathematical Society ( p-ISSN:2086-8952 | e-ISSN:2460-0245) published by the Indonesian Mathematical Society (IndoMS).

Indexed by:

logo DOAJLogo SintaThe Indonesian Publication Index-Portal Garuda Google Scholar logo zbMath Logo AMSLogo CrossrefLogo Thomson Reuters

Visitor Number : web statistics View My Stats

Creative Commons License
Journal of the Indonesian Mathematical Society by http://jims-a.org/index.php/jimsa is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.