Abstract
Graph labeling admits a distinct place in Discrete Mathematics and Combinatorics. In 1998, Hikoe Enomoto et al. brought out the idea of super edge-magic (SEMC) labelling of graphs. In this article, we shall provide a complete solution to an open problem, regarding double stars St, t , proposed by W. D. Wallis & A. M. Marr [9], by exhibiting a super edge-magic labeling of St, t , for all possible values of t and t. We will also provide a SEMC labelling of union of cycles Cr being disjoint and various trees and exhibit super edge-magicness of some cases of Usmanian Ladders and planar graphs involving chains of C 5.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Journal of Discrete Mathematical Sciences and Cryptography
Paper Title
Journal
Date
