Cm-SUPERMAGIC LABELING OF FRIENDSHIP GRAPHS

Cm-SUPERMAGIC LABELING OF FRIENDSHIP GRAPHS

T. Oner, M. Hussain, S. Banaras

[PDF]

Abstract

The friendship graph F^m_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.

Keywords

Magic labeling, covering, friendship graphs.