Ahlam Almulhim

Dr. Ahlam Almulhim

orcid

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

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

Representative Publications

View All Publications
7 September 2024 in Mathematics
Verified
Journal Article
Open access
PDF file
AAAhlam Almulhim
Ahlam Almulhim
BSBana Al Subaiei
Bana Al Subaiei
SMSAIFUL RAHMAN MONDAL
SAIFUL RAHMAN MONDAL
The notion of Roman {2}-domination was introduced in 2016 as a variant of Roman domination, a concept inspired by a defending strategy used by the emperor Constantine (272–337 AD) to protect the Roman Empire. Since then, a considerable number of papers on Roman {2}-domination and its variants have been published. In this paper, we survey published results on Roman {2}-domination as well as the main findings on Roman {2}-domination variants found in the literature. A list of open problems related to this notion and its variants are also given.

1 January 2022 in Journal of Mathematics
Verified
Journal Article
Open access
PDF file
AAAhlam Almulhim
Ahlam Almulhim
AAAbolape Deborah Akwu
Abolape Deborah Akwu
BSBana Al Subaiei
Bana Al Subaiei
A perfect Roman dominating function on a graphGis a functionf:V(G)⟶{0,1,2} for which every vertexvwithf(v) = 0 is adjacent to exactly one neighboruwithf(u) = 2. The weight offis the sum of the weights of the vertices. The perfect Roman domination number of a graphG, denoted by , is the minimum weight of a perfect Roman dominating function onG. In this paper, we prove that ifGis the Cartesian product of a pathPrand a pathPs, a pathPrand a cycleCs, or a cycleCrand a cycleCs, wherer,s> 5, then .

31 August 2023 in Symmetry
Verified
Journal Article
Open access
PDF file
AAAhlam Almulhim
Ahlam Almulhim
A total perfect Roman dominating function (TPRDF) on a graph G=(V,E) is a function f from V to {0,1,2} satisfying (i) every vertex v with f(v)=0 is a neighbor of exactly one vertex u with f(u)=2; in addition, (ii) the subgraph of G that is induced by the vertices with nonzero weight has no isolated vertex. The weight of a TPRDF f is ∑v∈Vf(v). The total perfect Roman domination number of G, denoted by γtRp(G), is the minimum weight of a TPRDF on G. In this paper, we initiated the study of total perfect Roman domination. We characterized graphs with the largest-possible γtRp(G). We proved that total perfect Roman domination is NP-complete for chordal graphs, bipartite graphs, and for planar bipartite graphs. Finally, we related γtRp(G) to perfect domination γp(G) by proving γtRp(G)≤3γp(G) for every graph G, and we characterized trees T of order n≥3 for which γtRp(T)=3γp(T). This notion can be utilized to develop a defensive strategy with some properties.

1 January 2022 in Discrete Mathematics
Verified
Journal Article
Open access
AAAhlam Almulhim
Ahlam Almulhim
HKH.A. Kierstead
H.A. Kierstead

1 January 2024 in Journal of Mathematics
Verified
Journal Article
Open access
AAAhlam Almulhim
Ahlam Almulhim
A perfect Roman {3}‐dominating function on a graph G = (V, E) is a function f : V⟶{0, 1, 2, 3} having the property that if f(v) = 0, then ∑u∈N(v)f(u) = 3, and if f(v) = 1, then ∑u∈N(v)f(u) = 2 for any vertex v ∈ V. The weight of a perfect Roman {3}‐dominating function f is the sum ∑v∈Vf(v). The perfect Roman {3}‐domination number of a graph G, denoted by , is the minimum weight of a perfect Roman {3}‐dominating function on G. In this paper, we initiate the study of a perfect Roman {3}‐domination, and we show that the decision problem associated with a perfect Roman {3}‐domination is NP‐complete for bipartite graphs. We also prove that if T is a tree of order n ≥ 2, then and characterize trees achieving this bound, and we give an infinity set of trees T of order n for which approaches this bound as n goes to infinity. Finally, we give the best upper bound of for some classes of graphs including regular, planar, and split graphs in terms of the order of the graphs.

1 January 2023 in AIMS Mathematics
Verified
Journal Article
Open access
PDF file
AAAhlam Almulhim
Ahlam Almulhim
A signed double Italian dominating function (SDIDF) on a graph $ G = (V, E) $ is a function $ f $ from $ V $ to $ \{-1, 1, 2, 3\} $, satisfying (ⅰ) $ \sum_{u\in N[v]}f(u)\ge1 $ for all $ v\in V $; (ⅱ) if $ f(v) = -1 $ for some $ v\in V $, then there exists $ A\subseteq N(v) $ such that $ \sum_{u\in A}f(u)\ge3 $; and (ⅲ) if $ f(v) = 1 $ for some $ v\in V $, then there exists $ A\subseteq N(v) $ such that $ \sum_{u\in A}f(u)\ge2 $. The weight of an SDIDF $ f $ is $ \sum_{v\in V}f(v) $. The signed double Italian domination number of $ G $ is the minimum weight of an SDIDF on $ G $. In this paper, we initiated the study of signed double Italian domination and proved that the decision problem associated with the signed double Italian domination is NP-complete. We also provided tight lower and upper bounds of a signed double Italian domination number of trees, and we characterized the trees achieving these bounds. Finally, we determined the signed double Italian domination number for some well-known graphs.