Advanced Search

Cm-supermagic labeling of friendship graphs

Thumbnail

View/Open

Date

2021

Author

Öner, Tarkan
Hussain, Muhammad
Banaras, Shakila

Metadata

Show full item record

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.

Abstract

The 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.

Volume

11

Issue

3

URI

http://belgelik.isikun.edu.tr/xmlui/handle/iubelgelik/3208
http://jaem.isikun.edu.tr/web/index.php/archive/112-vol11-no3/749

Collections

The following license files are associated with this item:

info:eu-repo/semantics/openAccess
Except where otherwise noted, this item's license is described as info:eu-repo/semantics/openAccess