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.