Issue |
E3S Web Conf.
Volume 387, 2023
International Conference on Smart Engineering for Renewable Energy Technologies (ICSERET-2023)
|
|
---|---|---|
Article Number | 05006 | |
Number of page(s) | 9 | |
Section | Information Secutity | |
DOI | https://doi.org/10.1051/e3sconf/202338705006 | |
Published online | 15 May 2023 |
Divided Square Difference Cordial Labeling Of Join Some Spider graphs
1 Assistant Professor, Patrician College of arts and Science, Affiliated to University of Madras, Chennai
2 Assistant Professor, Dr. Ambedkar Goverment Arts College, Chennai
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. We prove in this paper for relatively possible set of spider graphs with atmost one legs greaterthan one namely J(SP(1m,2n)),J(SP(1m,2n,31)), (SP(1m,2n,32)),J(SP(1m,2n,41)),J(SP(1m,2n,51).
Mathematics Subject Classification: 05C78
Key words: DividedSquare difference Cordial labelings / Join Spider graphs
© The Authors, published by EDP Sciences, 2023
This is an Open Access article distributed under the terms of the Creative Commons Attribution License 4.0, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.