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

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 tha...

Full description

Bibliographic Details
Main Authors:	Wamiliana, Wamiliana, Elfaki, Faiz Ahmed Mohamed, Faisol, Ahmad, Usman, Mustofa, Lestari, Isna
Format:	Article
Language:	English
Published:	IJCSNS 2015
Subjects:	QA Mathematics
Online Access:	http://irep.iium.edu.my/42865/ http://irep.iium.edu.my/42865/ http://irep.iium.edu.my/42865/1/IJCSNS_Wamiliana_et_al.pdf

id	iium-42865
recordtype	eprints
spelling	iium-428652017-08-08T06:10:40Z http://irep.iium.edu.my/42865/ Determining the pattern for 1- fault tolerant Hamiltonian cycle from generalized Petersen graph P(n,k) Wamiliana, Wamiliana Elfaki, Faiz Ahmed Mohamed Faisol, Ahmad Usman, Mustofa Lestari, Isna QA Mathematics 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. IJCSNS 2015 Article PeerReviewed application/pdf en http://irep.iium.edu.my/42865/1/IJCSNS_Wamiliana_et_al.pdf 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 http://ijcsns.org/
repository_type	Digital Repository
institution_category	Local University
institution	International Islamic University Malaysia
building	IIUM Repository
collection	Online Access
language	English
topic	QA Mathematics
spellingShingle	QA Mathematics Wamiliana, Wamiliana Elfaki, Faiz Ahmed Mohamed Faisol, Ahmad Usman, Mustofa Lestari, Isna Determining the pattern for 1- fault tolerant Hamiltonian cycle from generalized Petersen graph P(n,k)
description	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.
format	Article
author	Wamiliana, Wamiliana Elfaki, Faiz Ahmed Mohamed Faisol, Ahmad Usman, Mustofa Lestari, Isna
author_facet	Wamiliana, Wamiliana Elfaki, Faiz Ahmed Mohamed Faisol, Ahmad Usman, Mustofa Lestari, Isna
author_sort	Wamiliana, Wamiliana
title	Determining the pattern for 1- fault tolerant Hamiltonian cycle from generalized Petersen graph P(n,k)
title_short	Determining the pattern for 1- fault tolerant Hamiltonian cycle from generalized Petersen graph P(n,k)
title_full	Determining the pattern for 1- fault tolerant Hamiltonian cycle from generalized Petersen graph P(n,k)
title_fullStr	Determining the pattern for 1- fault tolerant Hamiltonian cycle from generalized Petersen graph P(n,k)
title_full_unstemmed	Determining the pattern for 1- fault tolerant Hamiltonian cycle from generalized Petersen graph P(n,k)
title_sort	determining the pattern for 1- fault tolerant hamiltonian cycle from generalized petersen graph p(n,k)
publisher	IJCSNS
publishDate	2015
url	http://irep.iium.edu.my/42865/ http://irep.iium.edu.my/42865/ http://irep.iium.edu.my/42865/1/IJCSNS_Wamiliana_et_al.pdf
first_indexed	2023-09-18T21:01:05Z
last_indexed	2023-09-18T21:01:05Z
_version_	1777410628108943360

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

Similar Items