Gelişmiş Arama

Basit öğe kaydını göster

dc.contributor.authorSankaran, Sriramen_US
dc.contributor.authorKaliyaperumal, Thirusanguen_US
dc.date.accessioned2021-01-20T11:57:23Z
dc.date.available2021-01-20T11:57:23Z
dc.date.issued2021
dc.identifier.citationSankaran, S. & Kaliyaperumal, T. (2021). I-Cordial labeling of spider graphs. TWMS Journal of Applied and Engineering Mathematics, 11(SI), 164-171.en_US
dc.identifier.issn2146-1147en_US
dc.identifier.issn2587-1013en_US
dc.identifier.urihttp://belgelik.isikun.edu.tr/xmlui/handle/iubelgelik/3032
dc.identifier.urihttp://jaem.isikun.edu.tr/web/index.php/archive/109-vol11-special-issue/645
dc.description.abstractLet G= (V, E) be a graph with p vertices and q edges. A graph G=(V,E)with p vertices and q edges is said to be an I-cordial labeling of a graph if there exists an injective map f from V to left perpendicular-p/2..p/2right perpendicular* or[-left perpendicularp/2right perpendicular..left perpendicularp/2right perpendicular] as p is even or odd respectively such that the injective mapping is defined for f (u) f (v) not equal 0 that induces an edge labeling f* : E ->{0, 1} where f*(uv) = 1 if f (u) f (v) > 0 and f* (uv) = 0 otherwise, such that the number of edges labeled with 1 and the number of edges labeled with 0 differ atmost by 1. If a graph satisfies the condition then graph is called I-Cordial labeling graph or I - Cordial graph. In this paper we intend to prove the spider graph S P (1(m), 2(t)) is integer I-cordial labeling graph and obtain some characteristics of I cordial labeling on the graph and we define M-Joins of Spider graph SP(1(m), 2(t)) and study their characteristics. Here we use the notation left perpendicular-p..pright perpendicular* = left perpendicularp..pright perpendicular - [0] and left perpendicular-p..pright perpendicular = [ x/x is an integer such that vertical bar x vertical bar <= p]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.subjectLabeling of graphsen_US
dc.subjectI-Cordial labeling of graphsen_US
dc.subjectSpider graphsen_US
dc.titleI-Cordial labeling of spider graphsen_US
dc.typeArticleen_US
dc.description.versionPublisher's Versionen_US
dc.identifier.volume11
dc.identifier.issueSI
dc.identifier.startpage164
dc.identifier.endpage171
dc.peerreviewedYesen_US
dc.publicationstatusPublisheden_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Başka Kurum Yazarı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