Edge-Magic Total Labeling on Vertex Amalgamation Graphs of a Star Graph with a Path Graph
DOI:
https://doi.org/10.46799/jss.v5i4.881Abstract
One of the topic graph theories is graph labeling. Let be a finite simple connected graph, a bijection from to where and is called an edge-magic total labeling of if there exists a contant (called the magic sum of ) such that for any edge of . The super edge-magic total labeling on a graph is the edge-magic total labeling which maps into the set . Let be a connected graph with a fixed vertex . The vertex amalgamation of graph onto a fixed vertex called terminal denoted by is a graph formed by taking all elements (vertices and edges) in with . In this study, we will show that vertex amalgamation graphs of a star graph with a path graph are edge-magic total and super edge-magic total labeling, with constructed vertex labelings and edge labelings to obtain intervals of the magic sums .
Downloads
Published
Issue
Section
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-ShareAlike 4.0 International. that allows others to share the work with an acknowledgement 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.
