| dc.contributor.author | Öner, Tarkan | |
| dc.date.accessioned | 2021-07-28T08:36:27Z | |
| dc.date.available | 2021-07-28T08:36:27Z | |
| dc.date.issued | 2021 | en_US |
| dc.identifier.issn | 2146-1147 | |
| dc.identifier.uri | http://jaem.isikun.edu.tr/web/index.php/archive/112-vol11-no3/749-cm-supermagic-labeling-of-friendship-graphs | |
| dc.identifier.uri | https://hdl.handle.net/20.500.12809/9415 | |
| dc.description.abstract | The friendship graph Fmn is obtained by joining n copies of the cycle graph Cm with a common vertex. In this work, we investigate the Cm-supermagic labeling of friendship graphs. | en_US |
| dc.item-language.iso | eng | en_US |
| dc.publisher | TURKIC WORLD MATHEMATICAL SOC | en_US |
| dc.item-rights | info:eu-repo/semantics/openAccess | en_US |
| dc.subject | Magic labeling | en_US |
| dc.subject | Covering | en_US |
| dc.subject | Friendship graphs | en_US |
| dc.title | C-m-SUPERMAGIC LABELING OF FRIENDSHIP GRAPHS | en_US |
| dc.item-type | article | en_US |
| dc.contributor.department | MÜ, Fen Fakültesi, Matematik Bölümü | en_US |
| dc.contributor.authorID | 0000-0002-2882-1666 | en_US |
| dc.contributor.institutionauthor | Öner, Tarkan | |
| dc.identifier.volume | 11 | en_US |
| dc.identifier.issue | 3 | en_US |
| dc.identifier.startpage | 906 | en_US |
| dc.identifier.endpage | 919 | en_US |
| dc.relation.journal | TWMS JOURNAL OF APPLIED AND ENGINEERING MATHEMATICS | en_US |
| dc.relation.publicationcategory | Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı | en_US |
