Abstract
A (p, q)–graph G is reverse super magic if there exists a bijection f : V ∪ E → {1, 2, …, p + q} such that is a constant for any edge uv ∈ E and f(E) = {l, 2, …, q}. Then f is a reverse super magic labeling of G. The reverse super magic strength of a reverse super magic graph G is defined as rsms (G) = min { is a reverse super magic labeling of G}. In this paper, a characterization of a triangle free reverse super magic graph to attain the lower bound of the reverse super magic strength has been obtained. Moreover, the reverse super magic strength of some new classes of graphs such as and has been computed.
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 callMore From: Journal of Discrete Mathematical Sciences and Cryptography
Disclaimer: 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.
