The Ramsey number for two graphs of order 5
| Author | Bataineh M.S. |
| Author | Vetrik T. |
| Author | Jaradat M.M.M. |
| Author | Rabaiah A.M.M. |
| Available date | 2019-11-03T11:47:38Z |
| Publication Date | 2018 |
| Publication Name | Journal of Discrete Mathematical Sciences and Cryptography |
| Resource | Scopus |
| ISSN | 9720529 |
| Abstract | For 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. |
| Sponsor | The work of T. Vetr�k was supported by the National Research Foundation of South Africa; Grant numbers: 112122, 90793. |
| Language | en |
| Publisher | Taylor and Francis Ltd. |
| Subject | (2010) 05C55 05C35 Chord Cycle Ramsey number Wheel |
| Type | Article |
| Pagination | 1523 - 1528 |
| Issue Number | 8-Jul |
| Volume Number | 21 |
Files in this item
| Files | Size | Format | View |
|---|---|---|---|
|
There are no files associated with this item. |
|||
This item appears in the following Collection(s)
-
Mathematics, Statistics & Physics [666 items ]