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...
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IJCSNS
2015
|
| Subjects: | |
| 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 |