Browsing by Subject "Theta graph"

Now showing items 1-8 of 8

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

    • Edge-maximal graphs without θ 7 -graphs 

      Bataineh, M.S.A.; Jaradat, M.M.M.; Al-Shboul, I.Y.A. ( Tokyo University of Science , 2011 , Article)
      Let G(n; θ2k+1, ≥ δ) denote the class of non-bipartite θ2k+1-free graphs on n vertices and minimum degree at least δ and let f (n; θ2k+1, ≥ δ) = max{ε(G): G ∈ G(n; θ2k+1, ≥ δ)}. In this paper we determinj an upker bound ...

    • Edge-Maximal θ2k+1-Edge Disjoint Free Graphs 

      Jaradat, Mohammed M. M.; Bataineh, Mohammed S. A. ( Kyungmoon Publishing , 2014 , Article)
      For two positive integers r and s, G(n; r; θs) denotes to the class of graphs on n vertices containing no r of edge disjoint θs-graphs and f(n; r; θs) = max{E(G) : G ∈ G(n; r; θs)}. In this paper, for integers r, k ≥ 2, ...

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