Browsing Materials Science & Technology by Subject "Independent set"

Now showing items 1-3 of 3

    • 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 ...