Ahmad Bani Abdelrahman

Dr. Ahmad Bani Abdelrahman


Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
25 February 2026 in Multimedia Tools and Applications
Verified
Journal Article
Closed access
PDF file
MAMohammad Al-Jamal
Mohammad Al-Jamal
MAMohammad Al-Talib
Mohammad Al-Talib
AAAhmad Bani Abdelrahman
Ahmad Bani Abdelrahman

2 April 2020 in Vibroengineering PROCEDIA
Verified
Journal Article
Open access
PDF file
AAAhmad Bani Abdelrahman
Ahmad Bani Abdelrahman
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.

1 January 2026 in International Journal of Mathematics and Mathematical Sciences
Verified
Journal Article
Open access
PDF file
AAAhmad Bani Abdelrahman
Ahmad Bani Abdelrahman
BABasem Alkhamaiseh
Basem Alkhamaiseh
MJM.M.M. Jaradat
M.M.M. Jaradat
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 2024 in Journal of Mathematics
Verified
Journal Article
Open access
AAAhmad Bani Abdelrahman
Ahmad Bani Abdelrahman
MJM.M.M. Jaradat
M.M.M. Jaradat
MBM. S. Bataineh
M. S. Bataineh
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 2026 in Journal of Mathematics
Verified
Journal Article
Open access
EREman Rawshdeh
Eman Rawshdeh
HAHeba Adel Abdelkarim
Heba Adel Abdelkarim
EREdris Rawashdeh
Edris Rawashdeh
AAAhmad Bani Abdelrahman
Ahmad Bani Abdelrahman
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.