Gelişmiş Arama

Basit öğe kaydını göster

Cm-supermagic labeling of friendship graphs

dc.contributor.authorÖner, Tarkanen_US
dc.contributor.authorHussain, Muhammaden_US
dc.contributor.authorBanaras, Shakilaen_US
dc.date.accessioned2021-07-30T12:01:37Z
dc.date.available2021-07-30T12:01:37Z
dc.date.issued2021
dc.identifier.citationÖner, T., Hussain, M. & Banaras, S. (2021). Cm-supermagic labeling of friendship graphs. TWMS Journal of Applied and Engineering Mathematics, 11(3), 906-919.en_US
dc.identifier.urihttp://belgelik.isikun.edu.tr/xmlui/handle/iubelgelik/3208
dc.identifier.urihttp://jaem.isikun.edu.tr/web/index.php/archive/112-vol11-no3/749
dc.description.abstractThe friendship graph F?n 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.language.isoenen_US
dc.publisherIşık University Pressen_US
dc.relation.ispartofTWMS Journal of Applied and Engineering Mathematicsen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.rightsAttribution-NonCommercial-NoDerivs 3.0 United States*
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/3.0/us/*
dc.subjectCoveringen_US
dc.subjectFriendship graphsen_US
dc.subjectMagic labelingen_US
dc.titleCm-supermagic labeling of friendship graphsen_US
dc.typeArticleen_US
dc.description.versionPublisher's Versionen_US
dc.identifier.volume11
dc.identifier.issue3
dc.identifier.startpage906
dc.identifier.endpage919
dc.peerreviewedYesen_US
dc.publicationstatusPublisheden_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Başka Kurum Yazarıen_US


Bu öğenin dosyaları:

Ad:
license_rdf
Boyut:
810bytes
Biçim:
application/rdf+xml
Göster/Aç
Thumbnail
Ad:
vol.11.no.3-27.pdf
Boyut:
355.0Kb
Biçim:
PDF
Açıklama:
Publisher's Version
Göster/Aç

Bu öğe aşağıdaki koleksiyon(lar)da görünmektedir.

Basit öğe kaydını göster

info:eu-repo/semantics/openAccess
Aksi belirtilmediği sürece bu öğenin lisansı: info:eu-repo/semantics/openAccess