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...
Saved in:
Main Authors: | Wamiliana, Wamiliana, Elfaki, Faiz Ahmed Mohamed, Faisol, Ahmad, Usman, Mustofa, Lestari, Isna |
---|---|
Format: | Article |
Language: | English |
Published: |
IJCSNS
2015
|
Subjects: | |
Online Access: | http://irep.iium.edu.my/42865/1/IJCSNS_Wamiliana_et_al.pdf http://irep.iium.edu.my/42865/ http://ijcsns.org/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
On the Burning Number of Generalized Petersen Graphs
by: Sim, Kai An, et al.
Published: (2018) -
Irregular total labeling on complete bipartite graph and union complete bipartite graphs
by: Daoud, Jamal Ibrahim, et al.
Published: (2010) -
Some greedy based algorithms for multi periods degree constrained minimum spanning tree problem
by: Wamiliana, Wamiliana, et al.
Published: (2015) -
Irregular total labeling on complete bipartite graph and union of complete Bipartite graphs
by: Daoud, Jamal Ibrahim, et al.
Published: (2009) -
Enhanced prim's algorithm for finding the hamiltonian cycle in a graph
by: Dinon, Nur Atiqah
Published: (2013)