Determining the pattern for 1- fault tolerant Hamiltonian cycle from generalized Petersen graph P(n,k)

Wamiliana, Wamiliana and Elfaki, Faiz Ahmed Mohamed and Faisol, Ahmad and Usman, Mustofa and Lestari, Isna (2015) Determining the pattern for 1- fault tolerant Hamiltonian cycle from generalized Petersen graph P(n,k). International Journal of Computer Science and Network Security (IJCSNS), 15 (4). pp. 26-30. ISSN 1738-7906

PDF - Published Version Restricted to Registered users only Download (282kB) | Request a copy

Abstract

Given a Generalized Petersen Graph P(n,k) a question can be asked by looking at its specific pattern whose 2n vertices and 3n edges, and its special degree on each vertices, which is 3. The degree of each vertices which is only one more than the vertices in Hamiltonian cycle makes a question: is that possible to find a relationship between Generalized Petersen Graph P(n,k) and Hamiltonian cycle, especially with 1-fault tolerant Hamiltonian where the fault occurs because either one vertex or one edge not included in the cycle. In this paper we will discuss about Generalized Petersen Graph P(n,1), if n odd, 3 ≤ n ≤ 13; and P(n,2), if n = 1(mod 6), or 3(mod 6) for 7 ≤ n ≤ 19.

Item Type:	Article (Journal)
Additional Information:	4925/42865
Uncontrolled Keywords:	generalized Petersen P(n,k) graph, Hamiltonian circuit, 1-fault-tolerant Hamiltonian
Subjects:	Q Science > QA Mathematics
Kulliyyahs/Centres/Divisions/Institutes (Can select more than one option. Press CONTROL button):	Kulliyyah of Engineering > Department of Science
Depositing User:	Dr faiz elfaki
Date Deposited:	11 May 2015 08:57
Last Modified:	08 Aug 2017 14:10
URI:	http://irep.iium.edu.my/id/eprint/42865

Actions (login required)

View Item