Browsing by Subject "Complete graph"

Now showing items 1-5 of 5

    • The cycle-complete graph Ramsey number r ( C 8 , K 8 ) 

      Jaradat, M.M.M.; Alzaleq, B.M.N. ( Tokyo University of Science , 2007 , Article)
      The cycle-complete graph Ramsey number r ( C m , K n ) is the smallest integer N such that every graph G of order N contains a cycle C m on m vertices or has independent number α ( G ) ≥ n . ...

    • The cycle-complete graph Ramsey number r(C6,K8)≤38 

      Jaradat, M.M.M.; Alzaleq, B.M.N. ( Tokyo University of Science , 2008 , Article)
      The cycle-complete graph Ramsey number r ( C m , K n ) is the smallest integer N such that every graph G of order N contains a cycle C m on m vertices or has independent number α ( G ) ≥ n . ...

    • The ramsey number for theta graph versus a clique of order three and four 

      Bataineh, M.S.A.; Jaradat, M.M.M.; Bateeha, M.S. ( University of Zielona Gora , 2014 , Article)
      For 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 ...

    • The theta-complete graph Ramsey number r(θk, K5); k = 7, 8, 9 

      Jaradat, A.M.M.; Baniabedalruhman, A.; Bataineh, M.S.; Jaradat, M.M.M. ( Forum-Editrice Universitaria Udinese SRL , 2021 , Article)
      Finding the Ramsey number is an important problem of the well-known family of the combinatorial problems in Ramsey theory. In this work, we investigate the Ramsey number r(θs, K5) for s = 7, 8, 9 where θs is the set of ...

    • The theta-complete graph Ramsey number R(θn K5) = 4n - 3 for n = 6 and n≥ 10 

      Jaradat, M. M.M.; Bataineh, M. S.A.; Al Hazeem, N. ( Charles Babbage Research Centre , 2017 , Article)
      For 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 of at least N vertices contains F1 or its complement contains F2 as a subgraph. In this ...