Gelişmiş Arama

Basit öğe kaydını göster

dc.contributor.authorPonraj, R.en_US
dc.contributor.authorGayathri, A.en_US
dc.contributor.authorSomasundaram, S.en_US
dc.date.accessioned2023-07-13T06:47:24Z
dc.date.available2023-07-13T06:47:24Z
dc.date.issued2023-07
dc.identifier.citationPonraj, 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.issn2146-1147en_US
dc.identifier.issn2587-1013en_US
dc.identifier.urihttp://belgelik.isikun.edu.tr/xmlui/handle/iubelgelik/5608
dc.identifier.urihttp://jaem.isikun.edu.tr/web/index.php/archive/121-vol13no3/1094
dc.description.abstractLet 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.isoenen_US
dc.publisherIşık University Pressen_US
dc.relation.ispartofTWMS Journal Of Applied And Engineering Mathematicsen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.rightsAttribution-NonCommercial-NoDerivs 3.0 United States*
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/3.0/us/*
dc.subjectPathen_US
dc.subjectStaren_US
dc.subjectCycleen_US
dc.subjectBistaren_US
dc.subjectComben_US
dc.subjectFanen_US
dc.titlePair difference cordial labeling of some union of graphsen_US
dc.typeArticleen_US
dc.description.versionPublisher's Versionen_US
dc.identifier.volume13
dc.identifier.issue3
dc.identifier.startpage1083
dc.identifier.endpage1095
dc.peerreviewedYesen_US
dc.publicationstatusPublisheden_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Başka Kurum Yazarıen_US
dc.indekslendigikaynakScopusen_US
dc.indekslendigikaynakEmerging Sources Citation Index (ESCI)en_US


Bu öğenin dosyaları:

Thumbnail

Bu öğe aşağıdaki koleksiyon(lar)da görünmektedir.

Basit öğe kaydını göster

info:eu-repo/semantics/openAccess
Aksi belirtilmediği sürece bu öğenin lisansı: info:eu-repo/semantics/openAccess