Gelişmiş Arama

Basit öğe kaydını göster

dc.contributor.authorVivik, Veninstine J.en_US
dc.contributor.authorGirija, G.en_US
dc.date.accessioned2020-10-26T09:22:48Z
dc.date.available2020-10-26T09:22:48Z
dc.date.issued2019
dc.identifier.citationVivik, V. J. & Girija, G. (2019). An algorithmic approach to equitable edge chromatic number of graphs. TWMS Journal Of Applied And Engineering Mathematics, 9(2), 374-383.en_US
dc.identifier.issn2146-1147en_US
dc.identifier.issn2587-1013en_US
dc.identifier.urihttp://belgelik.isikun.edu.tr/xmlui/handle/iubelgelik/2726
dc.identifier.urihttp://jaem.isikun.edu.tr/web/index.php/archive/101-vol9no2/418
dc.description.abstractThe equitable edge chromatic number is the minimum number of colors required to color the edges of graph G, for which G has a proper edge coloring and if the number of edges in any two color classes differ by at most one. In this paper, we obtain the equitable edge chromatic number of S?, Wn, Hn and Gn.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.subjectEquitable edge coloringen_US
dc.subjectWheelen_US
dc.subjectHelmen_US
dc.subjectGearen_US
dc.subjectSunleten_US
dc.titleAn algorithmic approach to equitable edge chromatic number of graphsen_US
dc.typeArticleen_US
dc.description.versionPublisher's Versionen_US
dc.identifier.volume9
dc.identifier.issue2
dc.identifier.startpage374
dc.identifier.endpage383
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