Show simple item record

AuthorBataineh M.S.
AuthorVetrik T.
AuthorJaradat M.M.M.
AuthorRabaiah A.M.M.
Available date2019-11-03T11:47:38Z
Publication Date2018
Publication NameJournal of Discrete Mathematical Sciences and Cryptography
ISSN9720529
URIhttp://dx.doi.org/10.1080/09720529.2018.1479179
URIhttp://hdl.handle.net/10576/12224
AbstractFor two graphs F1 and F2, the Ramsey number R(F1, F2) is the smallest positive integer r such that for every graph G on r vertices, G contains F1 as a subgraph or the complement of G contains F2 as a subgraph. We present the exact value of the Ramsey number R(?5, W5), where ?5 is the cycle with a chord and W5 is the wheel, both having 5 vertices. � 2018, � 2018 Taru Publications.
SponsorThe work of T. Vetr�k was supported by the National Research Foundation of South Africa; Grant numbers: 112122, 90793.
Languageen
PublisherTaylor and Francis Ltd.
dc.source Scopus
Subject(2010) 05C55
Subject05C35
SubjectChord
SubjectCycle
SubjectRamsey number
SubjectWheel
TitleThe Ramsey number for two graphs of order 5
TypeArticle
Pagination1523 - 1528
Issue Number8-Jul
Volume Number21


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record