dc.contributor.author | Mudartha, Irene Kulrekha | en_US |
dc.contributor.author | Sundareswaran, Raman | en_US |
dc.contributor.author | Swaminathan, Venkatasubramanian | en_US |
dc.date.accessioned | 2020-10-23T12:40:01Z | |
dc.date.available | 2020-10-23T12:40:01Z | |
dc.date.issued | 2019 | |
dc.identifier.citation | Mudartha, 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.issn | 2146-1147 | en_US |
dc.identifier.issn | 2587-1013 | en_US |
dc.identifier.uri | http://belgelik.isikun.edu.tr/xmlui/handle/iubelgelik/2718 | |
dc.identifier.uri | http://jaem.isikun.edu.tr/web/index.php/archive/101-vol9no2/410 | |
dc.description.abstract | A 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.iso | en | en_US |
dc.publisher | Işık University Press | en_US |
dc.relation.ispartof | TWMS Journal of Applied and Engineering Mathematics | en_US |
dc.rights | info:eu-repo/semantics/openAccess | en_US |
dc.rights | Attribution-NonCommercial-NoDerivs 3.0 United States | * |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/3.0/us/ | * |
dc.subject | Domination number | en_US |
dc.subject | Paired-domination | en_US |
dc.subject | Critical graph | en_US |
dc.title | Tight just excellent graphs | en_US |
dc.type | Article | en_US |
dc.description.version | Publisher's Version | en_US |
dc.identifier.volume | 9 | |
dc.identifier.issue | 2 | |
dc.identifier.startpage | 294 | |
dc.identifier.endpage | 304 | |
dc.peerreviewed | Yes | en_US |
dc.publicationstatus | Published | en_US |
dc.relation.publicationcategory | Makale - Uluslararası Hakemli Dergi - Başka Kurum Yazarı | en_US |