C-m-SUPERMAGIC LABELING OF FRIENDSHIP GRAPHS
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.
Source
TWMS JOURNAL OF APPLIED AND ENGINEERING MATHEMATICSVolume
11Issue
3URI
http://jaem.isikun.edu.tr/web/index.php/archive/112-vol11-no3/749-cm-supermagic-labeling-of-friendship-graphshttps://hdl.handle.net/20.500.12809/9415
