#TITLE_ALTERNATIVE#
We prove that the complete bipartite graph K{m,n} is Cp-supermagic for some m, n and p. <br /> <br />
Saved in:
| Main Author: | |
|---|---|
| Format: | Final Project |
| Language: | Indonesia |
| Online Access: | https://digilib.itb.ac.id/gdl/view/9823 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Institut Teknologi Bandung |
| Language: | Indonesia |
| id |
id-itb.:9823 |
|---|---|
| spelling |
id-itb.:98232017-09-27T11:43:08Z#TITLE_ALTERNATIVE# DENI PURNAMA (NIM 10105018), AGUS Indonesia Final Project INSTITUT TEKNOLOGI BANDUNG https://digilib.itb.ac.id/gdl/view/9823 We prove that the complete bipartite graph K{m,n} is Cp-supermagic for some m, n and p. <br /> <br /> 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 |
We prove that the complete bipartite graph K{m,n} is Cp-supermagic for some m, n and p. <br />
<br />
|
| format |
Final Project |
| author |
DENI PURNAMA (NIM 10105018), AGUS |
| spellingShingle |
DENI PURNAMA (NIM 10105018), AGUS #TITLE_ALTERNATIVE# |
| author_facet |
DENI PURNAMA (NIM 10105018), AGUS |
| author_sort |
DENI PURNAMA (NIM 10105018), AGUS |
| 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/9823 |
| _version_ |
1820664806429949952 |