dc.contributor.author | Kaliraj, Kalimuthu | en_US |
dc.contributor.author | Hari, Naresh Kumar | en_US |
dc.date.accessioned | 2020-10-23T09:29:35Z | |
dc.date.available | 2020-10-23T09:29:35Z | |
dc.date.issued | 2019 | |
dc.identifier.citation | Kaliraj, K. & Hari, N. K. (2019). Ramsey numbers for class of edgeless, complete and star graphs. TWMS Journal of Applied and Engineering Mathematics, 9(2), 220-224. | en_US |
dc.identifier.issn | 2146-1147 | |
dc.identifier.issn | 2587-1013 | |
dc.identifier.uri | http://belgelik.isikun.edu.tr/xmlui/handle/iubelgelik/2710 | |
dc.identifier.uri | http://jaem.isikun.edu.tr/web/index.php/archive/101-vol9no2/401 | |
dc.description.abstract | For any graph class G of any two positive integers i and j, the Ramsey number RG(i, j) is the smallest integer such that every graph in G on atleast RG(i, j) vertices has a clique of size i or an independent set of size j. In this paper, we found the Ramsey numbers for the graph class of edgeless graphs, complete graphs, star graphs and class of all edgeless and complete graphs. | en_US |
dc.language.iso | en | en_US |
dc.publisher | Işık University Press | 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 | Graph class and Ramsey numbers | en_US |
dc.title | Ramsey numbers for class of edgeless, complete and star graphs | en_US |
dc.type | Article | en_US |
dc.description.version | Publisher'S Version | en_US |
dc.relation.journal | TWMS Journal of Applied and Engineering Mathematics | en_US |
dc.identifier.volume | 9 | |
dc.identifier.issue | 2 | |
dc.identifier.startpage | 220 | |
dc.identifier.endpage | 224 | |
dc.peerreviewed | Yes | en_US |
dc.publicationstatus | Published | en_US |
dc.relation.publicationcategory | Makale - Uluslararası Hakemli Dergi - Başka Kurum Yazarı | en_US |