Bibliographic Details
| Title: |
Python implementation for edge sum divisor cordial labeling of Lagoon step graphs. |
| Authors: |
Vasanthi, J.1 (AUTHOR) vasanthij1977@gmail.com, Ramya, N.1 (AUTHOR) drramyamaths@gmail.com |
| Source: |
AIP Conference Proceedings. 2026, Vol. 3397 Issue 1, p1-10. 10p. |
| Subject Terms: |
*Graph labelings, *Python programming language, *Graph theory |
| Abstract: |
A graph G has vertex set V(G) and edge set E(G) where f: E(G) → {1,2,3 ... |E(G)|} be a bijection. For each vertex u label with 1 if f(e1) + f(e2) + f(e3) + ⋯ ... + f(es) is divided by 2 and label with 0 if it doesn't where e1, e2 ... es are edges that are incident with the vertex u. If | vf∗(0)−Vf∗(1)| ≤ 1, then the function f is referred as an Edge Sum Divisor cordial labeling (ESDC). A graph which satisfies an ESDC labeling which is called an ESDC graph. In this paper, we discuss about the Four Intersection opposite Lagoon Step graph and Four Intersection Mirror Lagoon Step graph are ESDC graphs. Also investigate an edge sum divisor Cordial labeling of the above graphs using python implementation. [ABSTRACT FROM AUTHOR] |
| Database: |
Academic Search Index |