The Ramsey number for two graphs of order 5
MetadataShow full item record
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.
- Mathematics, Statistics & Physics [138 items ]