Abstract
Strong edge antimagic total labelling of a simple graph G(V,E) is graph labelling which the vertex labels are consecutive integers from 1 to |V| such that, the weight of edges, i.e. the total label of the vertices incident to the edge, will form an ascending arithmetic sequence. This article discusses this kind of vertex labelling on multistar graphs. A multistar graph is an unconnected combination of star graphs. The study is a literature study with a mathematical proof. The results of the study is that multistar graphs have a strong edge antimagic total labelling. Furthermore, the labelling can be done on an unconnected combination of m star graphs and the difference of the weight of the edges are 1 and 2 with initial term and , respectively.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
