A note on the Ramsey numbers for theta graphs versus the wheel of order 5
| Author | Jaradat M.M.M. |
| Author | Bataineh M.S. |
| Author | Vetr?k T. |
| Author | Rabaiah A.M.M. |
| Available date | 2020-03-18T08:10:08Z |
| Publication Date | 2018 |
| Publication Name | AKCE International Journal of Graphs and Combinatorics |
| Resource | Scopus |
| ISSN | 9728600 |
| Abstract | The study of exact values and bounds on the Ramsey numbers of graphs forms an important family of problems in the extremal graph theory. For a set of graphs S and a graph F, the Ramsey number R(S,F) is the smallest positive integer r such that for every graph G on r vertices, G contains a graph in S as a subgraph or the complement of G contains F as a subgraph. Ramsey numbers of various graphs including theta graphs and wheels have been extensively studied. We extend known results in the area by presenting exact values of the Ramsey numbers R(?n,W5) for n?7, where ?n is the set of theta graphs of order n and W5 is the wheel graph of order 5. ? 2017 |
| Sponsor | The work of T. Vetr?k has been supported by the National Research Foundation of South Africa ; Grant numbers: 91499 , 90793 . |
| Language | en |
| Publisher | Kalasalingam University |
| Subject | Extremal graph theory Ramsey number Theta graph Wheel |
| Type | Article |
| Pagination | 187 - 189 |
| Issue Number | 2 |
| Volume Number | 15 |
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 ]