Konu "Covering" için JAEM 2021, Vol 11, No 3 listeleme
Toplam kayıt 1, listelenen: 1-1
-
Cm-supermagic labeling of friendship graphs
(Işık University Press, 2021)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.