BibTex Citation Data :
@article{JM12277, author = {Mohamad Hambali and Wamiliana . and Fitriani .}, title = {PERSAMAAN UMUM JUMLAH EDGE DAN TITIK PADA CYCLE EXTENSION CUBIC GRAPH}, journal = {MATEMATIKA}, volume = {17}, number = {3}, year = {2016}, keywords = {}, abstract = { In this research we will discuss about cycle extension of cubic graph. The cubic graphs used are the cucic graph with n ( V ( G )) ≤ 8 and k ≥ 3, ; k is the length of the cycle C and l i is the number of vertices or points on that located between and . The construction process for determining the use six operations which are M 1 , M 2 , M 3 , M 4 , M 5 , dan M 6 . The result of M 1 process on is a non Hamiltonian cycle while the results of M 2 , M 3 , M 4 , M 5 , and M 6 are Hamiltonian cycles. We also show that the number of vertives on the is n (V()) = n (V(G)) + 2 k , and the number of edges on the is n (E() = n (E(G)) + 3 k. }, url = {https://ejournal.undip.ac.id/index.php/matematika/article/view/12277} }
Refworks Citation Data :
In this research we will discuss about cycle extension of cubic graph. The cubic graphs used are the cucic graph with n(V(G)) ≤ 8 and k ≥ 3, ; k is the length of the cycle C and li is the number of vertices or points on that located between and . The construction process for determining the use six operations which are M1, M2, M3, M4, M5, dan M6. The result of M1 process on is a non Hamiltonian cycle while the results of M2, M3, M4, M5, and M6 are Hamiltonian cycles. We also show that the number of vertives on the is n(V()) = n (V(G)) + 2 k ,
and the number of edges on the is n(E() = n (E(G)) + 3 k.
Last update:
Last update: 2024-11-06 18:07:15