DOI QR코드

DOI QR Code

REVERSE EDGE MAGIC LABELING OF CARTESIAN PRODUCT, UNIONS OF BRAIDS AND UNIONS OF TRIANGULAR BELTS

  • REDDY, KOTTE AMARANADHA (Department of Mathematics, School of Advanced Sciences, Vellore Institute of Technology) ;
  • BASHA, S. SHARIEF (Department of Mathematics, School of Advanced Sciences, Vellore Institute of Technology)
  • 투고 : 2021.08.04
  • 심사 : 2021.12.07
  • 발행 : 2022.01.30

초록

Reverse edge magic(REM) labeling of the graph G = (V, E) is a bijection of vertices and edges to a set of numbers from the set, defined by λ : V ∪ E → {1, 2, 3, …, |V| + |E|} with the property that for every xy ∈ E, constant k is the weight of equals to a xy, that is λ(xy) - [λ(x) + λ(x)] = k for some integer k. We given the construction of REM labeling for the Cartesian Product, Unions of Braids and Unions of Triangular Belts. The Kotzig array used in this paper is the 3 × (2r + 1) kotzig array. we test the konow results about REM labelling that are related to the new results we found.

키워드

참고문헌

  1. S. Cichacz-Przenioslo et al., Vertex magic total labelings of 2-regular graphs, Disc. Math. 1 (2017), 3117-3124.
  2. A. Kotzig and A. Rosa, Magic valuations of finite graphs, Canad. Math. Bull. 13 (1970), 451-461. https://doi.org/10.4153/CMB-1970-084-1
  3. A.M. Marr and W.D. Wallis, Magic Graphs, second ed., Springer, 2013.
  4. I. Singgih, New methods for magic total labelings of graphs, Department of Mathematics and Statistics, University of Minnesota Duluth, 2015.
  5. Kotte amaranadha Reddy and S. Sharief Basha, Reverse edge magic lebelling of a cycle with cord, union o cycles and unions of paths, Advances in Mathematics: Scientific Journal 10 (2020), 571-581. https://doi.org/10.37418/amsj.10.1.56
  6. R.M. Figuera-Centeno et al., The place of super edgemagic labelings among other classes of labelings, Discrete Math. 231 (2001), 153-168. https://doi.org/10.1016/S0012-365X(00)00314-9
  7. Sin-Min Lee and Alexander Nien Tsu Lee, On super edgemagic graphs with many odd cycles, Congressus Numerantium https://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.92.6139&rep=rep1&type=pdf, 1-13.
  8. K. Wijaya and E.T. Baskoro, Labeling the edge-magic total on the product of two graphs, InProc. MIPA Seminar, ITB Bandung Indonesia, 2000.
  9. Kotte amaranadha Reddy and S. Sharief Basha, Critical set of caterpillar graph for secret sharing scheme based on reverse super edge magic labeling, International journal of scientific and technology research 11 (2009), 3534-3536.
  10. D. Froncek, Group distance magic labeling of Cartesian product of cycles, Australas. J Comb. 55 (2013), 167-174.
  11. T. Kojima, On C4-Supermagic labelings of the Cartesian product of paths and graphs, Discrete Mathematics 2 (2013), 164-173. https://doi.org/10.1016/j.disc.2012.09.005
  12. B. Freyberg, M. Keranen, Orientable Zn-distance magic labeling of the Cartesian product of many cycles, Electronic Journal of Graph Theory and Applications 5 (2017), 304-311. https://doi.org/10.5614/ejgta.2017.5.2.11
  13. C. Palanivelu and N. Neela, On super (a, d)-edge antimagic total labeling of cartesian product graphs, The International journal of analytical and experimental modal analysis 10 (2019), 245-259.
  14. M. Slamin et al., Edge-magic total labelings of wheels, fans and friendship graphs, Bull. Inst. Combin. Appl. 35 (2002), 89-98.