Divided Square Difference Cordial Labeling Of Join Some Spider graphs
Let G be a graph with itsvertices and edges. On defining bijective fnnctionρ:V(G) →{0,1,…,p}. For each edge assign the label with 1 if ρ*(ab)=∣ρ(a)2 - ρ(b)2 / ρ(a) - ρ(b)∣ is odd or 0 otherwise such that |eρ(1) -eρ0≤1 then the labeling is called as divided square difference cordial labeling graph. W...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
EDP Sciences
2023-01-01
|
| Series: | E3S Web of Conferences |
| Subjects: | |
| Online Access: | https://www.e3s-conferences.org/articles/e3sconf/pdf/2023/24/e3sconf_icseret2023_05006.pdf |