#### Filter Results:

- Full text PDF available (2)

#### Publication Year

2012

2017

- This year (3)
- Last 5 years (6)
- Last 10 years (6)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Mohammed M. M. Jaradat, M. S. A. Bataineh, M. K. Al-Qeyyam
- Ars Comb.
- 2017

- M. S. A. Bataineh, M. M. M. Jaradat, I. Y. A. Al-Shboul
- Ars Comb.
- 2016

- M. S. A. Bataineh, M. S. Bateeha, Mohammed M. M. Jaradat
- Discussiones Mathematicae Graph Theory
- 2014

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 this paper, we consider the Ramsey numbers for theta-complete graphs. We determine r(θn,Km) for m = 2, 3, 4 and n > m. More specifically, we… (More)

- M. M. M. Jaradat, M. S. A. Bataineh, N. Al Hazeem
- Ars Comb.
- 2017

- Jibran Iqbal, Yiping Du, Fares Howari, Mahmoud Bataineh, Nawshad Muhammad, Abdur Rahim
- Journal of AOAC International
- 2017

Sensitive detection of heavy metal ions in water is of great importance considering the effects that heavy metals have on public health. A developed fluidized bed enrichment technique was used to concentrate and detect low concentrations of Cu2+, Co2+, and Ni2+ in water samples by near-IR diffuse reflectance (NIDR) spectroscopy (NIDRS) directly without… (More)

- M. S. A. Bataineh, Mohammed M. M. Jaradat
- Discussiones Mathematicae Graph Theory
- 2012

For two positive integers r and s, G(n; r, s) denotes to the class of graphs on n vertices containing no r of s-edge disjoint cycles and f(n; r, s) = max{E(G) : G ∈ G(n; r, s)}. In this paper, for integers r ≥ 2 and k ≥ 1, we determine f(n; r, 2k+1) and characterize the edge maximal members in G(n; r, 2k + 1).

- ‹
- 1
- ›