Mohammad Abudayah

German Jordanian University

*This is an algorithmically generated author record based on publicly available information.

See Latest Publications

See Most Cited Publications

SciProfiles

Google Scholar

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

German Jordanian University

Research Subjects

Research Interests

Mohammad Abudayah has a total of 18 co-authors. Here are the top co-authors by number of shared publications:

Omar Alomari
College of Engineering and Technology, American University of the Middle East, Egaila 54200, Kuwait
11 shared publications
Torsten Sander
Fakultät für Informatik, Ostfalia Hochschule für angewandte Wissenschaften, Wolfenbüttel, Germany
6 shared publications
Hussein Al-Taani
School of Electrical Engineering and Information Technology, German Jordanian University, Amman 11180, Jordan
3 shared publications
Manal Ghanem
Department of Mathematics, The University of Jordan, Amman, Jordan
3 shared publications
Ma’mon Abu Hammad
Department of Mathematics, Al-Zaytoonah University of Jordan, Amman 11733, Jordan
3 shared publications
Adel Ouannas
Department of Mathematics, Faculty of Science, Islamic University of Madinah, Madinah 42351, Saudi Arabia
2 shared publications

Latest Publications

Sort by

Open Access
Website
Google Scholar
Cited by 1
- 31 January 2025
- Published by New York Business Global LLC in European Journal of Pure and Applied Mathematics
Langevin Fractional System Driven by Two $\psi$-Caputo Derivatives with Random Effects
by Mohamed Ziane, Hussein Al-Taani, Mohammad Ali Abudayah, Oualid Zentar, Ma’mOn Abu Hammad
A nonlinear Langevin fractional system involving two $\psi$-Caputo derivatives with random effects is investigated. First, a random version of Perov's fixed-point theorem in generalized Banach space endowed with the Bielecki-type vector-valued norm is employed to achieve a uniqueness result. Second, the existence result is established using Sadovskii's fixed point principle under fairly general conditions on the nonlinear forcing terms. Finally, our findings are justified through illustrative examples.
Website
Google Scholar
- 31 January 2025
- Published by New York Business Global LLC in European Journal of Pure and Applied Mathematics
Open Access
Langevin Fractional System Driven by Two $\psi$-Caputo Derivatives with Random Effects
by Mohamed Ziane, Hussein Al-Taani, Mohammad Ali Abudayah, Oualid Zentar, Ma’mOn Abu Hammad
A nonlinear Langevin fractional system involving two $\psi$-Caputo derivatives with random effects is investigated. First, a random version of Perov's fixed-point theorem in generalized Banach space endowed with the Bielecki-type vector-valued norm is employed to achieve a uniqueness result. Second, the existence result is established using Sadovskii's fixed point principle under fairly general conditions on the nonlinear forcing terms. Finally, our findings are justified through illustrative examples.
Cited by 1
Top Cited Papers
Open Access
Website
Google Scholar
Cited by 52
- 18 January 2025
- Published by MDPI AG in Symmetry
On Fractional Discrete Memristive Model with Incommensurate Orders: Symmetry, Asymmetry, Hidden Chaos and Control Approaches
by Hussein Al-Taani, Ma’mon Abu Hammad, Mohammad Abudayah, Louiza Diabi, Adel Ouannas
Memristives provide a high degree of non-linearity to the model. This property has led to many studies focusing on developing memristive models to provide more non-linearity. This article studies a novel fractional discrete memristive system with incommensurate orders using $ϑ_{i}$ -th Caputo-like operator. Bifurcation, phase portraits and the computation of the maximum Lyapunov Exponent $(L E_{m a x})$ are used to demonstrate their impact on the system’s dynamics. Furthermore, we employ the sample entropy approach (SampEn), $C_{0}$ complexity and the 0-1 test to quantify complexity and validate chaos in the incommensurate system. Studies indicate that the discrete memristive system with incommensurate fractional orders manifests diverse dynamical behaviors, including hidden chaos, symmetry, and asymmetry attractors, which are influenced by the incommensurate derivative values. Moreover, a 2D non-linear controller is presented to stabilize and synchronize the novel system. The work results are provided by numerical simulation obtained using MATLAB R2024a codes.
Website
Google Scholar
- 18 January 2025
- Published by MDPI AG in Symmetry
Top Cited Papers
Open Access
On Fractional Discrete Memristive Model with Incommensurate Orders: Symmetry, Asymmetry, Hidden Chaos and Control Approaches
by Hussein Al-Taani, Ma’mon Abu Hammad, Mohammad Abudayah, Louiza Diabi, Adel Ouannas
Memristives provide a high degree of non-linearity to the model. This property has led to many studies focusing on developing memristive models to provide more non-linearity. This article studies a novel fractional discrete memristive system with incommensurate orders using $ϑ_{i}$ -th Caputo-like operator. Bifurcation, phase portraits and the computation of the maximum Lyapunov Exponent $(L E_{m a x})$ are used to demonstrate their impact on the system’s dynamics. Furthermore, we employ the sample entropy approach (SampEn), $C_{0}$ complexity and the 0-1 test to quantify complexity and validate chaos in the incommensurate system. Studies indicate that the discrete memristive system with incommensurate fractional orders manifests diverse dynamical behaviors, including hidden chaos, symmetry, and asymmetry attractors, which are influenced by the incommensurate derivative values. Moreover, a 2D non-linear controller is presented to stabilize and synchronize the novel system. The work results are provided by numerical simulation obtained using MATLAB R2024a codes.
Cited by 52
Open Access
Website
Google Scholar
- 1 January 2025
- Published by Walter de Gruyter GmbH in Open Mathematics
𝕮-inverse of graphs and mixed graphs
by Omar Alomari, Mohammad Abudayah, Manal Ghanem
This article introduces a generalization of the concept of inverse graphs applicable to both graphs and mixed graphs. Given a graph $G$ with adjacency matrix $A (G)$ , the inverse graph $G^{- 1}$ is defined such that its adjacency matrix is similar to the inverse of $A (G)$ through a diagonal matrix with entries of $\pm 1$ . While this diagonal matrix may or may not exist for graphs with nonsingular adjacency matrices, our study extends the concept to include mixed graphs as well. It has been proven that for certain unicyclic graphs, such a diagonal matrix does not exist. Motivated by this, we generalized the definition of inverse graphs to include mixed graphs, allowing us to find inverse mixed graphs for a class previously shown to lack one.
Website
Google Scholar
- 1 January 2025
- Published by Walter de Gruyter GmbH in Open Mathematics
Open Access
𝕮-inverse of graphs and mixed graphs
by Omar Alomari, Mohammad Abudayah, Manal Ghanem
This article introduces a generalization of the concept of inverse graphs applicable to both graphs and mixed graphs. Given a graph $G$ with adjacency matrix $A (G)$ , the inverse graph $G^{- 1}$ is defined such that its adjacency matrix is similar to the inverse of $A (G)$ through a diagonal matrix with entries of $\pm 1$ . While this diagonal matrix may or may not exist for graphs with nonsingular adjacency matrices, our study extends the concept to include mixed graphs as well. It has been proven that for certain unicyclic graphs, such a diagonal matrix does not exist. Motivated by this, we generalized the definition of inverse graphs to include mixed graphs, allowing us to find inverse mixed graphs for a class previously shown to lack one.
Top Cited Papers
Open Access
Website
Google Scholar
Cited by 39
- 31 October 2024
- Published by MDPI AG in Symmetry
Asymmetry and Symmetry in New Three-Dimensional Chaotic Map with Commensurate and Incommensurate Fractional Orders
by Hussein Al-Taani, Ma’mon Abu Hammad, Mohammad Abudayah, Louiza Diabi, Adel Ouannas
According to recent research, discrete-time fractional-order models have greater potential to investigate behaviors, and chaotic maps with fractional derivative values exhibit rich dynamics. This manuscript studies the dynamics of a new fractional chaotic map-based three functions. We analyze the behaviors in commensurate and incommensurate orders, revealing their impact on dynamics. Through the maximum Lyapunov exponent $(L E_{m a x})$ , phase portraits, and bifurcation charts. In addition, we assess the complexity and confirm the chaotic features in the map using the approximation entropy $A p E n$ and $C_{0}$ complexity. Studies show that the commensurate and incommensurate derivative values influence the fractional chaotic map-based three functions, which exhibit a variety of dynamical behaviors, such as hidden attractors, asymmetry, and symmetry. Moreover, the new system’s stabilizing employing a 3D nonlinear controller is introduced. Finally, our study validates the research results using the simulation MATLAB R2024a.
Website
Google Scholar
- 31 October 2024
- Published by MDPI AG in Symmetry
Top Cited Papers
Open Access
Asymmetry and Symmetry in New Three-Dimensional Chaotic Map with Commensurate and Incommensurate Fractional Orders
by Hussein Al-Taani, Ma’mon Abu Hammad, Mohammad Abudayah, Louiza Diabi, Adel Ouannas
According to recent research, discrete-time fractional-order models have greater potential to investigate behaviors, and chaotic maps with fractional derivative values exhibit rich dynamics. This manuscript studies the dynamics of a new fractional chaotic map-based three functions. We analyze the behaviors in commensurate and incommensurate orders, revealing their impact on dynamics. Through the maximum Lyapunov exponent $(L E_{m a x})$ , phase portraits, and bifurcation charts. In addition, we assess the complexity and confirm the chaotic features in the map using the approximation entropy $A p E n$ and $C_{0}$ complexity. Studies show that the commensurate and incommensurate derivative values influence the fractional chaotic map-based three functions, which exhibit a variety of dynamical behaviors, such as hidden attractors, asymmetry, and symmetry. Moreover, the new system’s stabilizing employing a 3D nonlinear controller is introduced. Finally, our study validates the research results using the simulation MATLAB R2024a.
Cited by 39
Open Access
Website
Google Scholar
Cited by 1
- 1 January 2024
- Published by Walter de Gruyter GmbH in Special Matrices
γ-Inverse graph of some mixed graphs
by Wafa Boulahmar, Manal Ghanem, Mohammad Abudayah
Let $G$ be a graph. Then, the inverse graph $G^{- 1}$ of $G$ is defined to be a graph that has adjacency matrix similar to the inverse of the adjacency matrix of $G$ , where the similarity matrix is $\pm 1$ diagonal matrix. In this article, we introduced a generalization of this definition that serves the mixed graphs where the definition applied for the $α$ -Hermitian adjacency matrices of mixed graphs. Furthermore, for a class of unicyclic graphs, we were able to find an inverse mixed graph for a graph $G$ , where it was proven that $G^{- 1}$ does not exist.
Website
Google Scholar
- 1 January 2024
- Published by Walter de Gruyter GmbH in Special Matrices
Open Access
γ-Inverse graph of some mixed graphs
by Wafa Boulahmar, Manal Ghanem, Mohammad Abudayah
Let $G$ be a graph. Then, the inverse graph $G^{- 1}$ of $G$ is defined to be a graph that has adjacency matrix similar to the inverse of the adjacency matrix of $G$ , where the similarity matrix is $\pm 1$ diagonal matrix. In this article, we introduced a generalization of this definition that serves the mixed graphs where the definition applied for the $α$ -Hermitian adjacency matrices of mixed graphs. Furthermore, for a class of unicyclic graphs, we were able to find an inverse mixed graph for a graph $G$ , where it was proven that $G^{- 1}$ does not exist.
Cited by 1
Open Access
Website
Google Scholar
Cited by 3
- 1 January 2023
- Published by Georgia Southern University in Theory and Applications of Graphs
The gamma-Signless Laplacian Adjacency Matrix of Mixed Graphs
by Omar Alomari, Mohammad Abudayah, Manal Ghanem, German Jordanian University, The University of Jordan
The \alpha-Hermitian adjacency matrix H_\alpha of a mixed graph X has been recently introduced. It is a generalization of the adjacency matrix of unoriented graphs. In this paper, we consider a special case of the complex number \alpha. This enables us to define an incidence matrix of mixed graphs. Consequently, we define a generalization of line graphs as well as a generalization of the signless Laplacian adjacency matrix of graphs. We then study the spectral properties of the gamma-signless Laplacian adjacency matrix of a mixed graph. Lastly, we characterize when the signless Laplacian adjacency matrix of a mixed graph is singular and give lower and upper bounds of number of arcs and digons in terms of largest and lowest eigenvalue of the signless Laplacian adjacency matrix.
Website
Google Scholar
- 1 January 2023
- Published by Georgia Southern University in Theory and Applications of Graphs
Open Access
The gamma-Signless Laplacian Adjacency Matrix of Mixed Graphs
by Omar Alomari, Mohammad Abudayah, Manal Ghanem, German Jordanian University, The University of Jordan
The \alpha-Hermitian adjacency matrix H_\alpha of a mixed graph X has been recently introduced. It is a generalization of the adjacency matrix of unoriented graphs. In this paper, we consider a special case of the complex number \alpha. This enables us to define an incidence matrix of mixed graphs. Consequently, we define a generalization of line graphs as well as a generalization of the signless Laplacian adjacency matrix of graphs. We then study the spectral properties of the gamma-signless Laplacian adjacency matrix of a mixed graph. Lastly, we characterize when the signless Laplacian adjacency matrix of a mixed graph is singular and give lower and upper bounds of number of arcs and digons in terms of largest and lowest eigenvalue of the signless Laplacian adjacency matrix.
Cited by 3
Open Access
Website
Google Scholar
Cited by 4
- 1 January 2023
- Published by Walter de Gruyter GmbH in Special Matrices
Incidence matrices and line graphs of mixed graphs
by Mohammad Abudayah, Omar Alomari, Torsten Sander
In the theory of line graphs of undirected graphs, there exists an important theorem linking the incidence matrix of the root graph to the adjacency matrix of its line graph. For directed or mixed graphs, however, there exists no analogous result. The goal of this article is to present aligned definitions of the adjacency matrix, the incidence matrix, and line graph of a mixed graph such that the mentioned theorem is valid for mixed graphs.
Website
Google Scholar
- 1 January 2023
- Published by Walter de Gruyter GmbH in Special Matrices
Open Access
Incidence matrices and line graphs of mixed graphs
by Mohammad Abudayah, Omar Alomari, Torsten Sander
In the theory of line graphs of undirected graphs, there exists an important theorem linking the incidence matrix of the root graph to the adjacency matrix of its line graph. For directed or mixed graphs, however, there exists no analogous result. The goal of this article is to present aligned definitions of the adjacency matrix, the incidence matrix, and line graph of a mixed graph such that the mentioned theorem is valid for mixed graphs.
Cited by 4
Website
Google Scholar
Cited by 8
- 5 September 2022
- Published by Elsevier in Journal of the Franklin Institute
Novel space shift keying MIMO technique based on a Steiner triple system
by Raed Mesleh, Mohammad Abudayah, Omar Hiari
Website
Google Scholar
- 5 September 2022
- Published by Elsevier in Journal of the Franklin Institute
Novel space shift keying MIMO technique based on a Steiner triple system
by Raed Mesleh, Mohammad Abudayah, Omar Hiari
Cited by 8
Open Access
Website
Google Scholar
Cited by 12
- 31 July 2022
- Published by New York Business Global LLC in European Journal of Pure and Applied Mathematics
Hermitian Adjacency Matrices of Mixed Graphs
by Mohammad Ali Abudayah, Omar Alomari, Torsten Sander
The traditional adjacency matrix of a mixed graph is not symmetric in general, hence its eigenvalues may be not real. To overcome this obstacle, several authors have recently defined and studied various Hermitian adjacency matrices of digraphs or mixed graphs. In this work we unify previous work and offer a new perspective on the subject by introducing the concept of monographs. Moreover, we consider questions of cospectrality.
Website
Google Scholar
- 31 July 2022
- Published by New York Business Global LLC in European Journal of Pure and Applied Mathematics
Open Access
Hermitian Adjacency Matrices of Mixed Graphs
by Mohammad Ali Abudayah, Omar Alomari, Torsten Sander
The traditional adjacency matrix of a mixed graph is not symmetric in general, hence its eigenvalues may be not real. To overcome this obstacle, several authors have recently defined and studied various Hermitian adjacency matrices of digraphs or mixed graphs. In this work we unify previous work and offer a new perspective on the subject by introducing the concept of monographs. Moreover, we consider questions of cospectrality.
Cited by 12
Website
Google Scholar
- 1 January 2020
- Published by Mathematical Notes in Miskolc Mathematical Notes
A new class of special functions in higher dimensions
by H. Laith, A. Mohammad, H. Dutta
Website
Google Scholar
- 1 January 2020
- Published by Mathematical Notes in Miskolc Mathematical Notes
A new class of special functions in higher dimensions
by H. Laith, A. Mohammad, H. Dutta

Show all