Edge maximal C2k+1-edge disjoint free graphs. - Mohammed S. A. Bataineh; Mohammed M. M. Jaradat (Discuss. Math. Graph Theory, 2012)

The Ramsey number for theta graph versus a clique of order three and four. - Mohammed S. A. Bataineh; M. S. Bateeha; Mohammed M. M. Jaradat (Discuss. Math. Graph Theory, 2014)

Edge-Maximal Graphs Without θ5-Graphs. - Mohammed S. A. Bataineh; Mohammed M. M. Jaradat; I. Y. A. Al-Shboul (Ars Comb., 2016)

On the basis number of the wreath product of paths with wheels and some related problems. - Mohammed M. M. Jaradat; Mohammad Saleh Bataineh; M. K. Al-Qeyyam (Ars Comb., 2017)

The theta-complete graph Ramsey number R(θn, K5) = 4n-3 for n=6 and n ³ 10. - Mohammed M. M. Jaradat; Mohammed S. A. Bataineh; N. Al Hazeem (Ars Comb., 2017)

A note on the Ramsey numbers for theta graphs versus the wheel of order 5. - Mohammed M. M. Jaradat; Mohammad Saleh Bataineh; Tomás Vetrík; Ayat M. M. Rabaiah (AKCE Int. J. Graphs Comb., 2018)

On the zagreb connection indices of hex and honeycomb networks. - Zahid Raza; Mohammad Saleh Bataineh; Mark Essa K. Sukaiti (J. Intell. Fuzzy Syst., 2021)

Edge-maximal θ2k+1-free non-bipartite Hamiltonian graphs of odd order. - Mohammed M. M. Jaradat; A. Baniabedalruhman; Mohammed S. A. Bataineh; A. M. M. Jaradat; A. A. Al-Rhayyel (AKCE Int. J. Graphs Comb., 2022)