The Ramsey number for two graphs of order 5. (17th November 2018)

• Record Type: Journal Article
• Authors: Bataineh, Mohammad S.; Vetrík, Tomáš; Jaradat, Mohammed M. M.; Rabaiah, Ayat M. M.
• Is Part Of: Journal of discrete mathematical sciences & cryptography. Volume 21:Number 7/8(2018)
• Page Start: 1523
• Page End: 1528
• Publication Date: 2018-11-17
• Subjects: (2010) 05C55 -- 05C35; Ramsey number -- Cycle -- Chord -- Wheel; Computer science -- Mathematics -- Periodicals; Cryptography -- Periodicals; Computer science -- Mathematics; Cryptography; Periodicals; 004.0151
• DOI: 10.1080/09720529.2018.1479179
• Languages: English
• ISSNs: 0972-0529

Abstract

Abstract: For two graphs F 1 and F 2, the Ramsey number R ( F 1, F 2 ) is the smallest positive integer r such that for every graph G on r vertices, G contains F 1 as a subgraph or the complement of G contains F 2 as a subgraph. We present the exact value of the Ramsey number R ( θ 5, W 5 ), where θ 5 is the cycle with a chord and W5 is the wheel, both having 5 vertices.