Abstract
In this paper, we investigate the adjacency matrix of reverse super edge magic vertex graph and use this graph to construct other reverse super edge magic graphs with the same edge weight set. Additionally, by combining known reverse super edge magic labelled graphs, we give a construction for a new reverse super edge magic graph
Highlights
Let G be a finite simple undirected graph
We investigate the adjacency matrix of reverse super edge magic vertex graph and use this graph to construct other reverse super edge magic graphs with the same edge weight set
By combining known reverse super edge magic labelled graphs, we give a construction for a new reverse super edge magic graph
Summary
Let A be an adjacency matrix of G, the rows and columns of A can be labeled using 1,2, ... The weight f(x) + f(y) is the same as the sum of labels of vertices on skew diagonal adjacency matrix that has "1" element. Let A = (aij) be an adjacency matrix of a maximal EAV graph G. Let A be the adjacency matrix of an EAV graph G of order v. If we move the element "1" of A along the skew-diagonal line, this matrix is an adjacency matrix of an EAV graph that has the same weights set as A. Another known result for maximal RSEM labeling is given
Sign-in/Register to view highlights & summary 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 callMore From: International Journal of Engineering & Technology
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.
