Show simple item record

AuthorJaradat M.M.M.
AuthorBataineh M.S.
AuthorVetr?k T.
AuthorRabaiah A.M.M.
Available date2020-03-18T08:10:08Z
Publication Date2018
Publication NameAKCE International Journal of Graphs and Combinatorics
ResourceScopus
ISSN9728600
URIhttp://dx.doi.org/10.1016/j.akcej.2017.08.002
URIhttp://hdl.handle.net/10576/13328
AbstractThe 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
SponsorThe work of T. Vetr?k has been supported by the National Research Foundation of South Africa ; Grant numbers: 91499 , 90793 .
Languageen
PublisherKalasalingam University
SubjectExtremal graph theory
Ramsey number
Theta graph
Wheel
TitleA note on the Ramsey numbers for theta graphs versus the wheel of order 5
TypeArticle
Pagination187 - 189
Issue Number2
Volume Number15
dc.accessType Abstract Only


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