Divided Square Difference Cordial Labeling of Various Graphs


Abstract views: 14 / PDF downloads: 13

Authors

  • Vimal Patel Department of Mathematics, Surendranagar University, Ambedkarnagar, Surendranagar, Gujarat, India
  • Suresh Sorathia Department of Mathematics, Surendranagar University, Ambedkarnagar, Surendranagar, Gujarat, India
  • Amit Rokad Department of Mathematics, M. G. Science Institute (Affiliated to Gujarat University), Ahmedabad, Gujarat, India

Keywords:

Sum divisor cordial labeling, Twig graph, Pentagon Snake Graph, Spider Graph

Abstract

In this paper we prove that alternate triangular belt graph, twig graph, duplication of the top vertex Alternate triangular snake graph, duplication of top vertex Pentagon snake graph, jellyfish $(n,n)$, Spider graph with $n$ spokes $\mathcal{S}_{n,2}$ are divided square difference cordial graphs.

Downloads

Published

04-11-2025

How to Cite

Vimal Patel, Suresh Sorathia, & Amit Rokad. (2025). Divided Square Difference Cordial Labeling of Various Graphs. International Journal of Mathematics And Its Applications, 13(3), 197–203. Retrieved from https://ijmaa.in/index.php/ijmaa/article/view/1620

Issue

Vol. 13 No. 3 (2025)

Section

Research Article

License

Copyright (c) 2025 International Journal of Mathematics And its Applications

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.