• A note on the Ramsey numbers for theta graphs versus the wheel of order 5 

      Jaradat M.M.M.; Bataineh M.S.; Vetr?k T.; Rabaiah A.M.M. ( Kalasalingam University , 2018 , Article)
      The study of exact values and bounds on the Ramsey numbers of graphs forms an important family of problems in the extremal graph theory. For a set of graphs S and a graph F, the Ramsey number R(S,F) is the smallest positive ...
    • Edge maximal non-bipartite Hamiltonian graphs without theta graphs of order 7 

      Bataineh, M.S.; Al-Rhayyel, A.A.; Mustafa, Zead; Jaradat, M.M.M. ( Forum-Editrice Universitaria Udinese SRL , 2019 , Article)
      For a set of graphs F, let H(n; F) denote the class of non-bipartite Hamiltonian graphs on n vertices that does not contain any graph of F as a subgraph and h(n; F) = max{E(G): G ? H(n; F)} where E(G) is the number of edges ...
    • Extremal number of theta graphs of order 7 

      Jaradat, M. M.M.; Bataineh, M. S.; Al-Rhayyel, A. A.; Mustafa, Zead ( Boletim da Sociedade Paranaense de Matematica , 2021 , Article)
      For a set of graphsF, letH(n;F) denote the class of non-bipartiteHamiltonian graphs onnvertices that does not contain any graph ofFas a subgraphandh(n;F) = max{E(G) :G∈H(n;F)}whereE(G) is the number of edges inG.In this ...
    • 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 ...