#TITLE_ALTERNATIVE#
In this paper, we prove that some Cn-cactus graph is Cn-supermagic. A Cn-Cactus graph is a connected graph obtained from a cycle Cn by joining each vertices in Cn to one of vertices in other cycle Cn.
Saved in:
| Main Author: | |
|---|---|
| Format: | Final Project |
| Language: | Indonesia |
| Online Access: | https://digilib.itb.ac.id/gdl/view/10065 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Institut Teknologi Bandung |
| Language: | Indonesia |
| id |
id-itb.:10065 |
|---|---|
| spelling |
id-itb.:100652017-09-27T11:43:08Z#TITLE_ALTERNATIVE# (NIM 10105066), AYUNINGTYAS Indonesia Final Project INSTITUT TEKNOLOGI BANDUNG https://digilib.itb.ac.id/gdl/view/10065 In this paper, we prove that some Cn-cactus graph is Cn-supermagic. A Cn-Cactus graph is a connected graph obtained from a cycle Cn by joining each vertices in Cn to one of vertices in other cycle Cn. text |
| institution |
Institut Teknologi Bandung |
| building |
Institut Teknologi Bandung Library |
| continent |
Asia |
| country |
Indonesia Indonesia |
| content_provider |
Institut Teknologi Bandung |
| collection |
Digital ITB |
| language |
Indonesia |
| description |
In this paper, we prove that some Cn-cactus graph is Cn-supermagic. A Cn-Cactus graph is a connected graph obtained from a cycle Cn by joining each vertices in Cn to one of vertices in other cycle Cn. |
| format |
Final Project |
| author |
(NIM 10105066), AYUNINGTYAS |
| spellingShingle |
(NIM 10105066), AYUNINGTYAS #TITLE_ALTERNATIVE# |
| author_facet |
(NIM 10105066), AYUNINGTYAS |
| author_sort |
(NIM 10105066), AYUNINGTYAS |
| title |
#TITLE_ALTERNATIVE# |
| title_short |
#TITLE_ALTERNATIVE# |
| title_full |
#TITLE_ALTERNATIVE# |
| title_fullStr |
#TITLE_ALTERNATIVE# |
| title_full_unstemmed |
#TITLE_ALTERNATIVE# |
| title_sort |
#title_alternative# |
| url |
https://digilib.itb.ac.id/gdl/view/10065 |
| _version_ |
1820664860345630720 |