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