On Cycle-Super magic Labeling of Some Families of Graphs
DOI:
https://doi.org/10.21015/vtm.v6i1.275Abstract
In this work we have formulated the result of H-magic labeling of some families of graphs which included wheel graph, fan graph, ladder graph and triangular ladder. The edges of these graphs were subdivided into equal nodes and we formulated total magic and supermagic labeling of these families of graphs. A labeling of a graph is basically assigning positive integers to the edges and vertices and H-magic labeling is define as a bijection is called -magic labeling of if there exists a positive integer -called the magic sum, such that for any subgraph of isomorphic to , the sum is equal to the magic sum, . A graph is -magic if it admits an -magic labeling. In addition, if -magic labeling has the property that , then the graph is -supermagic. .Downloads
Published
2017-04-22
How to Cite
Riaz, I. (2017). On Cycle-Super magic Labeling of Some Families of Graphs. VFAST Transactions on Mathematics, 5(1), 18–32. https://doi.org/10.21015/vtm.v6i1.275
Issue
Section
Articles
License
Authors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License (CC-By) that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).
This work is licensed under a Creative Commons Attribution License CC BY