Ahmad Baniabedalruhman
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Ahmad Baniabedalruhman has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Mohammed M. M. Jaradat
Department of Mathematics and Statistics , Qatar University , Doha , Qatar , qu.edu.qa
2 shared publications - Basem Alkhamaiseh
Department of Mathematics , Yarmouk University , Irbid , Jordan , yu.edu.jo
1 shared publication - Edris Rawashdeh
Department of Mathematics Yarmouk University Irbid Jordan yu.edu.jo
1 shared publication - Eman Rawshdeh
Department of Basic Scientific Sciences Al-Huson University College Al-Balqa Applied University Irbid Jordan bau.edu.jo
1 shared publication - Heba Adel Abdelkarim
Department of Mathematics Irbid National University Irbid Jordan inu.edu.jo
1 shared publication M. S. Bataineh
1 shared publication
Latest Publications
- 25 February 2026
- Published by Springer Nature in Multimedia Tools and Applications
- Vol. 85 (3) , 186
Enhancing image encryption security with a 2D SF-SIMM hyperchaotic map
- 25 February 2026
- Published by Springer Nature in Multimedia Tools and Applications
- Vol. 85 (3) , 186
Enhancing image encryption security with a 2D SF-SIMM hyperchaotic map
- Open Access
- 1 January 2026
- Published by Wiley in Journal of Mathematics
- Vol. 2026 (1)
Spectral Characterization of the Eccentricity Matrix for Clean Graphs Over Rings of Specific Orders
In this paper, we study the eccentricity matrices of the clean graphs and . We begin by constructing these graphs and determining their eccentricity matrices. Then, we find the spectra of these matrices, that is, all eigenvalues together with their algebraic multiplicities.
- 1 January 2026
- Published by Wiley in Journal of Mathematics
- Vol. 2026 (1)
Open AccessSpectral Characterization of the Eccentricity Matrix for Clean Graphs Over Rings of Specific Orders
In this paper, we study the eccentricity matrices of the clean graphs and . We begin by constructing these graphs and determining their eccentricity matrices. Then, we find the spectra of these matrices, that is, all eigenvalues together with their algebraic multiplicities.
- Open Access
- 1 January 2026
- Published by Wiley in International Journal of Mathematics and Mathematical Sciences
- Vol. 2026 (1) , 6398287
Computing Exact Edge Geodetic Numbers in K‐Powered Path and Cycle Graphs
For any two vertices u and v in a graph G , u − v geodesic is the shortest path between u and v . A set S of vertices in G is called an edge geodetic cover for G if every edge in G belongs to a geodesic between two vertices of S . The minimum cardinality of an edge geodetic cover is called the edge geodetic number and is denoted by eg( G ). In this paper, we determine the exact edge geodetic number of k ‐powered paths and k ‐powered cycles. The proofs rely on a careful characterization of semiextreme vertices and geodesic covering arguments. The obtained results extend previous work on edge geodetic parameters and provide new insights into metric properties of graph powers.
- 1 January 2026
- Published by Wiley in International Journal of Mathematics and Mathematical Sciences
- Vol. 2026 (1) , 6398287
Open AccessComputing Exact Edge Geodetic Numbers in K‐Powered Path and Cycle Graphs
For any two vertices u and v in a graph G , u − v geodesic is the shortest path between u and v . A set S of vertices in G is called an edge geodetic cover for G if every edge in G belongs to a geodesic between two vertices of S . The minimum cardinality of an edge geodetic cover is called the edge geodetic number and is denoted by eg( G ). In this paper, we determine the exact edge geodetic number of k ‐powered paths and k ‐powered cycles. The proofs rely on a careful characterization of semiextreme vertices and geodesic covering arguments. The obtained results extend previous work on edge geodetic parameters and provide new insights into metric properties of graph powers.
- Open Access
- 1 January 2024
- Published by Wiley in Journal of Mathematics
- Vol. 2024 (1)
On the Ramsey Number for Theta Graphs Versus the Complete Graph of Order Six
The Ramsey number r(G, H) is the smallest positive integer n such that any graph W of order n contains G as a subgraph or its complement contains H as a subgraph. In this paper, we find the exact value for the Ramsey number r(θn, K6); k ≥ 6; n ≥ 6, where θn is a theta graph of order n and K6 is the complete graph of order 6.
- 1 January 2024
- Published by Wiley in Journal of Mathematics
- Vol. 2024 (1)
Open AccessOn the Ramsey Number for Theta Graphs Versus the Complete Graph of Order Six
The Ramsey number r(G, H) is the smallest positive integer n such that any graph W of order n contains G as a subgraph or its complement contains H as a subgraph. In this paper, we find the exact value for the Ramsey number r(θn, K6); k ≥ 6; n ≥ 6, where θn is a theta graph of order n and K6 is the complete graph of order 6.
- Open Access
- 2 April 2020
- Published by JVE International Ltd. in Vibroengineering PROCEDIA
- Vol. 30, 210-213
A coupled volume-of-fluid and level set method in interDyMFoam solver
InterDyMFoam is a solver for calculating immiscible two-phase flow in an open source OpenFOAM software. The solver uses the volume-of-fluid method (VOF) for capturing the fluid-fluid interface. The solver is modified to work with the coupled VOF and level set (LS) method. In the proposed method, the VOF is used to capture the interface since it is a mass conserving and the LS is used to calculate the curvature and physical quantities near the interface. A bubble rising in column liquids is used to compare the solvers. The proposed method gives an accurate calculations for the physical properties in two phase flow problems and handles the topological change of the interface.
- 2 April 2020
- Published by JVE International Ltd. in Vibroengineering PROCEDIA
- Vol. 30, 210-213
Open AccessA coupled volume-of-fluid and level set method in interDyMFoam solver
InterDyMFoam is a solver for calculating immiscible two-phase flow in an open source OpenFOAM software. The solver uses the volume-of-fluid method (VOF) for capturing the fluid-fluid interface. The solver is modified to work with the coupled VOF and level set (LS) method. In the proposed method, the VOF is used to capture the interface since it is a mass conserving and the LS is used to calculate the curvature and physical quantities near the interface. A bubble rising in column liquids is used to compare the solvers. The proposed method gives an accurate calculations for the physical properties in two phase flow problems and handles the topological change of the interface.