#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 |
| Summary: | 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. |
|---|