dc.contributor.author | Ponraj, R. | en_US |
dc.contributor.author | Gayathri, A. | en_US |
dc.contributor.author | Somasundaram, S. | en_US |
dc.date.accessioned | 2023-07-13T06:47:24Z | |
dc.date.available | 2023-07-13T06:47:24Z | |
dc.date.issued | 2023-07 | |
dc.identifier.citation | Ponraj, R., Gayathri, A. & Somasundaram, S. (2023). Pair difference cordial labeling of some union of graphs. TWMS Journal Of Applied And Engineering Mathematics, 13(3), 1083-1095. | en_US |
dc.identifier.issn | 2146-1147 | en_US |
dc.identifier.issn | 2587-1013 | en_US |
dc.identifier.uri | http://belgelik.isikun.edu.tr/xmlui/handle/iubelgelik/5608 | |
dc.identifier.uri | http://jaem.isikun.edu.tr/web/index.php/archive/121-vol13no3/1094 | |
dc.description.abstract | Let G = (V, E) be a (p, q) graph. Define ? = {p/2 if p is even p?1/2 if p is odd and L = {±1, ±2, ±3, · · · , ±?} called the set of labels. Consider a mapping f : V ? L by assigning different labels in L to the different elements of V when p is even and different labels in L to p-1 elements of V and repeating a label for the remaining one vertex when p is odd. The labeling as defined above is said to be a pair difference cordial labeling if for each edge uv of G there exists a labeling |f(u) ? f(v)| such that ?f1 ? ?fc1 ? 1, where ?f1 and ?fc1respectively denote the number of edges labeled with 1 and number of edges not labeled with 1. A graph G for which there exists a pair difference cordial labeling is called a pair difference cordial graph. In this paper we investigate the pair difference cordial labeling behavior of the union of some graphs like path, cycle, star and bistar graph. | en_US |
dc.language.iso | en | en_US |
dc.publisher | Işık University Press | en_US |
dc.relation.ispartof | TWMS Journal Of Applied And Engineering Mathematics | en_US |
dc.rights | info:eu-repo/semantics/openAccess | en_US |
dc.rights | Attribution-NonCommercial-NoDerivs 3.0 United States | * |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/3.0/us/ | * |
dc.subject | Path | en_US |
dc.subject | Star | en_US |
dc.subject | Cycle | en_US |
dc.subject | Bistar | en_US |
dc.subject | Comb | en_US |
dc.subject | Fan | en_US |
dc.title | Pair difference cordial labeling of some union of graphs | en_US |
dc.type | Article | en_US |
dc.description.version | Publisher's Version | en_US |
dc.identifier.volume | 13 | |
dc.identifier.issue | 3 | |
dc.identifier.startpage | 1083 | |
dc.identifier.endpage | 1095 | |
dc.peerreviewed | Yes | en_US |
dc.publicationstatus | Published | en_US |
dc.relation.publicationcategory | Makale - Uluslararası Hakemli Dergi - Başka Kurum Yazarı | en_US |
dc.indekslendigikaynak | Scopus | en_US |
dc.indekslendigikaynak | Emerging Sources Citation Index (ESCI) | en_US |