Gelişmiş Arama

Basit öğe kaydını göster

dc.contributor.authorMudartha, Irene Kulrekhaen_US
dc.contributor.authorSundareswaran, Ramanen_US
dc.contributor.authorSwaminathan, Venkatasubramanianen_US
dc.date.accessioned2020-10-23T12:40:01Z
dc.date.available2020-10-23T12:40:01Z
dc.date.issued2019
dc.identifier.citationMudartha, I. K., Sundareswaran, R. & Swaminathan, V. (2019). Tight just excellent graphs. TWMS Journal of Applied and Engineering Mathematics, 9(2), 294-304.en_US
dc.identifier.issn2146-1147en_US
dc.identifier.issn2587-1013en_US
dc.identifier.urihttp://belgelik.isikun.edu.tr/xmlui/handle/iubelgelik/2718
dc.identifier.urihttp://jaem.isikun.edu.tr/web/index.php/archive/101-vol9no2/410
dc.description.abstractA graph G is ?-excellent if for every vertex v, there exists a chromatic partition ? such that {v} ? ?.A graph G is just ?-excellent if every vertex appears as a singleton in exactly one ?-partition. In this paper, a special type of just ?-excellence namely tight just ?-excellence is defined and studied.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.subjectDomination numberen_US
dc.subjectPaired-dominationen_US
dc.subjectCritical graphen_US
dc.titleTight just excellent graphsen_US
dc.typeArticleen_US
dc.description.versionPublisher's Versionen_US
dc.identifier.volume9
dc.identifier.issue2
dc.identifier.startpage294
dc.identifier.endpage304
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