Journal of applied mathematics & informatics

The Korean Society for Computational and Applied Mathematics (한국전산응용수학회)
권호 표지
DOI QR코드

DOI QR Code

A FAMILY OF SPIDER GRAPH ON SUM DIVISOR CORDIAL LABELING WITH APPLICATION

  • T. CHRISTY (Department of Mathematics, Patrician College of Arts and Science, Affiliated to University of Madras) ;
  • G. PALANI (Department of Mathematics, Dr. Ambedkar Government Arts College) ;
  • E. CHANDRASEKARAN (Veltech Rangarajan Dr. Sagunthala R & D Institute of Science and Technology)
  • Received : 2024.07.05
  • Accepted : 2026.05.26
  • Published : 2026.05.30
Download PDF
⟨ Previous Next ⟩

Abstract

A Graph G with p vertices and q edges is called a sum divisor cordial labeling if a bijection function exists ρ : V → {1, 2, 3, ...p} such that for each edge ab ∈ E assign the label 1, if 2|(ρ(a) + ρ(b))| and 0 otherwise, satisfying the condition |eρ(1) - eρ(0)| ≤ 1,The number of edges labeled with 1 is eρ(1) and The number of edges labeled with 0 is eρ(0) .In this paper, we establish a proof for a generally feasible collection of spider graphs with atleast one additional leg SP(1n, 2n), SP(1m, 2n, 31), SP(1m, 2n, 32), SP(1m, 2n, 41), SP(1m, 2n, 42), SP(1m, 2n, 51) SP(1m, 2n, 52). In this paper we identify an application using Affline Cipher for Cyber security through encryption and decryption.

Keywords

References

  1. J.A. Gallian, A Dynamic Survey of Graph labeling, The Electronic J. Combin. 18 (2015), D56.
  2. F. Harary, Graph Theory, Addison-Wesley, Reading, Mass, 1972.
  3. P. Lawrence Rozario Raj and R. Lawence Joseph Manoharan, Some Result on Divisor Cordial Labeling of Graphs, International Journal of Innovative Science Engineering and Technology 1 (2014), 10.
  4. A. Lourdusamy and F. Patrick, Sum Divisor cordial graphs, Proyecciones Journal of Mathematics 35 (2016), 119-136. https://doi.org/10.22199/issn.0717-6279-2016
  5. I.W. Sudarsana, A. Hendra, Adiwijaya and D.Y. Setyawan, On super edge anti magic total labeling for t-joint copies of wheel, Far East Journal of Mathematical Sciences 69 (2012), 275-283.
  6. S. Caminiti, I. Finocchi and R. Peterschi, On Coding Labeled Trees, Theoretical Computer Science 382 (2007), 97-108. https://doi.org/10.1016/j.tcs.2007.03.009
  7. I.W. Sudarsana, E.T. Baskoro, S. Uttunggadewa and D. Ismaimuza, Expansion techniques on the super edge antimagic total graphs, Journal of Combinatorial Mathematics and Combinatorial Computing 71 (2009), 189-199.
  8. I.W. Sudarsana, S.A. Suryanto, D. Lusianti and N.P.A.P.S. Putri, An Application of Super Mean and Magic Graphs Labeling on Cryptography System, Journal of Physics: Conference Series 1763 (2021), 012052. https://doi.org/10.1088/1742-6596/1763/1/012052
  9. A. Sugumaran and K. Rajesh. Some new results on sum divisor cordial graphs, Annals of Pure and Applied Mathematics 14 (2017), 45-52. https://doi.org/10.22457/apam
  10. R. Varatharajan, S. Navaneethakrishnan and K. Nagarajan, Diuisor cordial graphs, Inter-national J. Math. Combin. 4 (2011), 15-25.