Algorithmic Approach to Signed Cordiality of Shell Butterfly Networks


V.Jude Annie Cynthia, E. Padmavathy
Department of Mathematics, Stella Maris College, University of Madras, Chennai, India.


A shell butterfly graph is defined to be a double shell with exactly two pendant edges at the apex and the right shell with m vertices, the left shell with l vertices. In this paper, we have provided algorithms in order to label the vertices and edges of the graph and have proved that the graph admits signed cordial labeling and signed product cordial labeling.