Cycle-based super edge-magic graphs and their super edge-magic sequences
by G.S.G.N. Anjaneyulu; A. Vijayabarathi
International Journal of Computing Science and Mathematics (IJCSM), Vol. 6, No. 4, 2015

Abstract: In this paper, we have introduced a new concept of super edge-magic sequence (SEMS) of a super edge-magic graph (SEMG) with p vertices and q edges. The super edge-magic sequence of natural numbers is denoted by {x_i}, 1 ≤ i ≤ q. This sequence need not to be monotonic. We also extend the notion of cycle iteratively for constructing new SEMS based on the 'sequence for cycle', from which we acquire some families like Petersen graph and its extension, web graph and its extension and others.

Online publication date: Sat, 19-Sep-2015

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computing Science and Mathematics (IJCSM):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com