Show simple item record

AuthorBataineh, M.S.A.
AuthorJaradat, M.M.M.
AuthorBateeha, M.S.
Available date2023-11-09T05:37:22Z
Publication Date2014
Publication NameDiscussiones Mathematicae - Graph Theory
ResourceScopus
ISSN12343099
URIhttp://dx.doi.org/10.7151/dmgt.1730
URIhttp://hdl.handle.net/10576/49115
AbstractFor any two graphs F1 and F2, the graph Ramsey number r(F1, F2) is the smallest positive integer N with the property that every graph on at least N vertices contains F1 or its complement contains F2 as a subgraph. In this paper, we consider the Ramsey numbers for theta-complete graphs. We determine r(θn, Km) for m = 2, 3, 4 and n > m. More specifically, we establish that r(θn, Km) = (n − 1)(m − 1) + 1 for m = 3, 4 and n > m.
Languageen
PublisherUniversity of Zielona Gora
SubjectComplete graph
Independent set
Ramsey number
Theta graph
TitleThe ramsey number for theta graph versus a clique of order three and four
TypeArticle
Pagination223-232
Issue Number2
Volume Number34
dc.accessType Open Access


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record