default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMohammed M. M. Jaradat
Person information
- affiliation: Qatar University, Department of Mathematics and Physics, Doha, Qatar
- affiliation: Yarmouk University, Department of Mathematics, Irbid, Jordan
- affiliation (PhD 2001): University of Pittsburgh, Department of Mathematics, PA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j28]Mohammed M. M. Jaradat
, A. Baniabedalruhman, Mohammed S. A. Bataineh, A. M. M. Jaradat, A. A. Al-Rhayyel:
Edge-maximal θ2k+1-free non-bipartite Hamiltonian graphs of odd order. AKCE Int. J. Graphs Comb. 19(3): 282-286 (2022)- [j27]Roqia Butush, Zead Mustafa, Mohammed M. M. Jaradat:
Solving Integral Equations Using Weakly Compatible Mappings via D*-Metric Spaces. Axioms 11(5): 189 (2022) - 2021
- [j26]Muhammad Shoaib Sardar, Jia-Bao Liu, Imran Siddique, Mohammed M. M. Jaradat:
A Novel and Efficient Method for Computing the Resistance Distance. IEEE Access 9: 107104-107110 (2021)
2010 – 2019
- 2019
- [j25]Hassen Aydi, Tawseef Rashid, Qamrul Haq Khan, Zead Mustafa, Mohammed M. M. Jaradat:
Fixed Point Results Using Ft-Contractions in Ordered Metric Spaces Having t-Property. Symmetry 11(3): 313 (2019) - [j24]Zead Mustafa, Vahid Parvaneh, Mohammed M. M. Jaradat, Zoran Kadelburg:
Extended Rectangular b-Metric Spaces and Some Fixed Point Theorems for Contractive Mappings. Symmetry 11(4): 594 (2019) - [j23]Murchana Neog, Mohammed M. M. Jaradat, Pradip Debnath:
Common Fixed Point Results of Set Valued Maps for Aφ-Contraction and Generalized ϕ-Type Weak Contraction. Symmetry 11(7): 894 (2019) - [j22]Mohammed M. M. Jaradat, Babak Mohammadi, Vahid Parvaneh, Hassen Aydi, Zead Mustafa:
PPF-Dependent Fixed Point Results for Multi-Valued ϕ-F-Contractions in Banach Spaces and Applications. Symmetry 11(11): 1375 (2019) - 2018
- [j21]Mohammed M. M. Jaradat, Mohammad Saleh Bataineh, Tomás Vetrík, Ayat M. M. Rabaiah:
A note on the Ramsey numbers for theta graphs versus the wheel of order 5. AKCE Int. J. Graphs Comb. 15(2): 187-189 (2018) - 2017
- [j20]Mohammed M. M. Jaradat, Mohammad Saleh Bataineh, M. K. Al-Qeyyam:
On the basis number of the wreath product of paths with wheels and some related problems. Ars Comb. 131: 239-253 (2017) - [j19]Mohammed M. M. Jaradat, Mohammed S. A. Bataineh, N. Al Hazeem:
The theta-complete graph Ramsey number R(θn, K5) = 4n-3 for n=6 and n ³ 10. Ars Comb. 134: 177-191 (2017) - 2016
- [j18]Mohammed S. A. Bataineh, Mohammed M. M. Jaradat, I. Y. A. Al-Shboul:
Edge-Maximal Graphs Without θ5-Graphs. Ars Comb. 124: 193-207 (2016) - [j17]Mohammed M. M. Jaradat:
On the basis number of the wreath product of ladders. Ars Comb. 127: 293-314 (2016) - 2014
- [j16]Mohammed S. A. Bataineh, M. S. Bateeha, Mohammed M. M. Jaradat:
The Ramsey number for theta graph versus a clique of order three and four. Discuss. Math. Graph Theory 34(2): 223-232 (2014) - 2012
- [j15]Mohammed S. A. Bataineh, Mohammed M. M. Jaradat:
Edge maximal C2k+1-edge disjoint free graphs. Discuss. Math. Graph Theory 32(2): 271-278 (2012) - 2010
- [j14]Mohammed M. M. Jaradat:
Fundamental group and cycle space of dual graphs and applications. Appl. Math. Comput. 217(2): 580-582 (2010) - [j13]Mohammed M. M. Jaradat:
A new upper bound of the basis number of the lexicographic product of graphs. Ars Comb. 97 (2010)
2000 – 2009
- 2009
- [j12]Zachary Bradshaw, Mohammed M. M. Jaradat:
Minimum cycle bases for direct products of K2 with complete graphs. Australas. J Comb. 43: 127-132 (2009) - 2008
- [j11]Mohammed M. M. Jaradat:
Minimal cycle bases of the lexigraphic product of graphs. Discuss. Math. Graph Theory 28(2): 229-247 (2008) - 2006
- [j10]Maref Y. M. Alzoubi, Mohammed M. M. Jaradat:
The Basis Number of The Composition of Theta Graphs with Some Graphs. Ars Comb. 79 (2006) - [j9]Mohammed M. M. Jaradat:
On the basic number and the minimum cycle bases of the wreath product of some graphs I. Discuss. Math. Graph Theory 26(1): 113-134 (2006) - 2005
- [j8]Mohammed M. M. Jaradat, Maref Y. Alzoubi:
An upper bound of the basis number of the lexicographic product of graphs. Australas. J Comb. 32: 305-312 (2005) - [j7]Mohammed M. M. Jaradat:
The Basis Number of the Direct Product of a Theta Graph and a Path. Ars Comb. 75 (2005) - [j6]Mohammed M. M. Jaradat:
On the Anderson-Lipman conjecture and some related problems. Discret. Math. 297(1-3): 167-173 (2005) - [j5]Mohammed M. M. Jaradat:
An upper bound of the basis number of the strong product of graphs. Discuss. Math. Graph Theory 25(3): 391-406 (2005) - [j4]Maref Y. Alzoubi, Mohammed M. M. Jaradat:
On the basis number of the composition of different ladders with some graphs. Int. J. Math. Math. Sci. 2005(12): 1861-1868 (2005) - [j3]Mohammed M. M. Jaradat:
On the edge coloring of graph products. Int. J. Math. Math. Sci. 2005(16): 2669-2676 (2005) - 2003
- [j2]Mohammed M. M. Jaradat:
On the basis number of the direct product of graphs. Australas. J Comb. 27: 293-306 (2003) - [j1]Mohammed M. M. Jaradat:
On The Hamiltonian Decomposition of Special Product of Graphs. Ars Comb. 69 (2003)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:15 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
