Gelişmiş Arama

Basit öğe kaydını göster

dc.contributor.authorMundadiya, Snehaen_US
dc.contributor.authorParejiya, Jaydeepen_US
dc.contributor.authorJariya, Mahesh M.en_US
dc.date.accessioned2024-04-02T18:47:11Z
dc.date.available2024-04-02T18:47:11Z
dc.date.issued2024-04
dc.identifier.citationMundadiya, S., Parejiya, J. & Jariya, M. M. Root cube mean cordial labeling of Cn ∨ Cm, for n, m ∈ N. TWMS Journal Of Applied And Engineering Mathematics, 14(2), 460-472.en_US
dc.identifier.issn2146-1147en_US
dc.identifier.issn2587-1013en_US
dc.identifier.urihttp://belgelik.isikun.edu.tr/xmlui/handle/iubelgelik/5943
dc.identifier.urihttps://jaem.isikun.edu.tr/web/index.php/current/124-vol14no2/1189
dc.description.abstractAll the graphs considered in this article are simple and undirected. Let G = (V(G), E(G)) be a simple undirected Graph. A function f : V (G) ? {0, 1, 2} is called root cube mean cordial labeling if the induced function f? : E(G) ? {0, 1, 2} defined by f? (uv) = bq((f(u))3+(f(v))3/2c satisfies the condition |vf (i) ? vf (j)| ? 1 and |ef (i) ? ef (j)| ? 1 for any i, j ? {0, 1, 2}, where vf (x) and ef (x) denotes the number of vertices and number of edges with label x respectively and bxc denotes the greatest integer less than or equals to x. A Graph G is called root cube mean cordial if it admits root cube mean cordial labeling. In this article we have shown that the join of two cycles Cn ? Cm is not a root cube mean cordial and also we have provided graph which is root cube mean cordial.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.subjectCycleen_US
dc.subjectRoot cube mean cordial labelingen_US
dc.subjectJoin of two graphs G ∨ Hen_US
dc.subjectLabelingen_US
dc.subjectCorona of graphen_US
dc.titleRoot cube mean cordial labeling of Cn ? Cm, for n, m ? Nen_US
dc.typeArticleen_US
dc.description.versionPublisher's Versionen_US
dc.identifier.volume14
dc.identifier.issue2
dc.identifier.startpage460
dc.identifier.endpage472
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