E3-cordial graphs

Simple item page
dc.contributor.authorCahit, I
dc.contributor.authorYilmaz, R
dc.date.accessioned2026-02-06T18:22:08Z
dc.date.issued2000
dc.departmentDoğu Akdeniz Üniversitesi
dc.description.abstractIn this paper generalization of edge-cordial labellings are introduced and studied for special classes of trees and graphs.
dc.identifier.endpage127
dc.identifier.issn0381-7032
dc.identifier.scopus2-s2.0-0348232997
dc.identifier.scopusqualityN/A
dc.identifier.startpage119
dc.identifier.urihttps://hdl.handle.net/11129/9643
dc.identifier.volume54
dc.identifier.wosWOS:000085703600009
dc.identifier.wosqualityN/A
dc.indekslendigikaynakWeb of Science
dc.indekslendigikaynakScopus
dc.language.isoen
dc.publisherCharles Babbage Res Ctr
dc.relation.ispartofArs Combinatoria
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı
dc.rightsinfo:eu-repo/semantics/closedAccess
dc.snmzKA_WoS_20260204
dc.subjectCordial Graphs
dc.subjectGraceful
dc.titleE3-cordial graphs
dc.typeArticle

Files

Collections

WoS Indexed Publications Collection
Scopus İndeksli Yayınlar Koleksiyonu