Mohammed M. M. Jaradat

Orcid: 0000-0002-4238-4861

Affiliations:
  • Qatar University, Department of Mathematics and Physics, Doha, Qatar
  • Yarmouk University, Department of Mathematics, Irbid, Jordan
  • University of Pittsburgh, Department of Mathematics, PA, USA (PhD 2001)


According to our database1, Mohammed M. M. Jaradat authored at least 28 papers between 2003 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
Edge-maximal θ2k+1-free non-bipartite Hamiltonian graphs of odd order.
AKCE Int. J. Graphs Comb., September, 2022

Solving Integral Equations Using Weakly Compatible Mappings via D*-Metric Spaces.
Axioms, 2022

2021
A Novel and Efficient Method for Computing the Resistance Distance.
IEEE Access, 2021

2019
Common Fixed Point Results of Set Valued Maps for <i>A<sub>φ</sub></i>-Contraction and Generalized <i>ϕ</i>-Type Weak Contraction.
Symmetry, 2019

Extended Rectangular <i>b</i>-Metric Spaces and Some Fixed Point Theorems for Contractive Mappings.
Symmetry, 2019

PPF-Dependent Fixed Point Results for Multi-Valued ϕ-F-Contractions in Banach Spaces and Applications.
Symmetry, 2019

Fixed Point Results Using <i>F<sub>t</sub></i>-Contractions in Ordered Metric Spaces Having <i>t</i>-Property.
Symmetry, 2019

2018
A note on the Ramsey numbers for theta graphs versus the wheel of order 5.
AKCE Int. J. Graphs Comb., 2018

2017
The theta-complete graph Ramsey number R(θ<sub>n</sub>, K<sub>5</sub>) = 4n-3 for n=6 and n ³ 10.
Ars Comb., 2017

On the basis number of the wreath product of paths with wheels and some related problems.
Ars Comb., 2017

2016
On the basis number of the wreath product of ladders.
Ars Comb., 2016

Edge-Maximal Graphs Without θ<sub>5</sub>-Graphs.
Ars Comb., 2016

2014
The Ramsey number for theta graph versus a clique of order three and four.
Discuss. Math. Graph Theory, 2014

2012
Edge maximal <i>C<sub>2k+1</sub></i>-edge disjoint free graphs.
Discuss. Math. Graph Theory, 2012

2010
A new upper bound of the basis number of the lexicographic product of graphs.
Ars Comb., 2010

Fundamental group and cycle space of dual graphs and applications.
Appl. Math. Comput., 2010

2009
Minimum cycle bases for direct products of K<sub>2</sub> with complete graphs.
Australas. J Comb., 2009

2008
Minimal cycle bases of the lexigraphic product of graphs.
Discuss. Math. Graph Theory, 2008

2006
On the basic number and the minimum cycle bases of the wreath product of some graphs I.
Discuss. Math. Graph Theory, 2006

The Basis Number of The Composition of Theta Graphs with Some Graphs.
Ars Comb., 2006

2005
On the edge coloring of graph products.
Int. J. Math. Math. Sci., 2005

On the basis number of the composition of different ladders with some graphs.
Int. J. Math. Math. Sci., 2005

An upper bound of the basis number of the strong product of graphs.
Discuss. Math. Graph Theory, 2005

On the Anderson-Lipman conjecture and some related problems.
Discret. Math., 2005

The Basis Number of the Direct Product of a Theta Graph and a Path.
Ars Comb., 2005

An upper bound of the basis number of the lexicographic product of graphs.
Australas. J Comb., 2005

2003
On The Hamiltonian Decomposition of Special Product of Graphs.
Ars Comb., 2003

On the basis number of the direct product of graphs.
Australas. J Comb., 2003


  Loading...