Abstract
In this paper, we deduce the equivalence relationship among strongly c‐elegant labelling, super‐edge magic total labelling, edge antimagic total labelling, and super (t, 1)‐magical labelling. We study some properties of the graph with a strongly c‐elegant labelling. On the basis of small‐scale graphs with strongly c‐elegant labelling, several types of large‐scale graphs are constructed through graph operations, and we further prove the existence of their strongly c‐elegant labelling. In addition, we also define a transformation of strongly c‐elegant labelling, which provides a method for the transformation between several strongly c‐elegant labellings of a graph.
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.
