Abstract
A reverse vertex magic labeling of a graph G = (V,E) is a bijection such that for every vertex , is a constant . It is well known that all complete graphs Kn admit a reverse magic labeling. In this paper, we present a new proof of this theorem using the concepts of twin factorization and magic square.
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.
