S. Sheikholeslami

activity

20182024

most citedTotal Roman {2}-Dominating functions in Graphs

20 citations · 41 across the 6 of their papers we have counts for

collaborators

8 papers

math.CO2024★ 20 cited

Total Roman {2}-Dominating functions in Graphs

H. Abdollahzadeh Ahangar, M. Chellali, S. M. Sheikholeslami +1

A Roman ${2}$ -dominating function (R2F) is a function $f : V \to {0, 1, 2}$ with the property that for every vertex $v \in V$ with $f (v) = 0$ there is a neighbor $u$ of $v$ wit…

math.CO2024★ 4 cited

On the outer independent total double Roman dominating functions

H. Abdolahzadeh Ahangar, M. Chellali, S. M. Sheikholeslami +1

Let ${0, 1, \dots, t}$ be abbreviated by $[t] .$ A double Roman dominating function (DRDF) on a graph $Γ = (V, E)$ is a map $l : V \to [3]$ satisfying \textrm{(i)} if $l (r) = 0$ the…

math.CO2024★ 17 cited

Maximal double Roman domination in graphs

H. Abdollahzadeh Ahangar, M. Chellali, S. M. Sheikholeslami +1

A maximal double Roman dominating function (MDRDF) on a graph $G = (V, E)$ is a function $f : V (G) \to {0, 1, 2, 3}$ such that \textrm{(i) }every vertex $v$ with $f (v) = 0$ is adjac…

math.CO2021

Roman domination in graphs with minimum degree at least two and some forbidden cycles

S. M. Sheikholeslami, M. Chellali, R. Khoeilar +2

Let $G = (V, E)$ be a graph of order $n$ and let $γ_{R} (G)$ and $\partial (G)$ denote the Roman domination number and the differential of $G,$ respectively. In this paper we prove tha…

math.CO2021

New upper bounds for the forgotten index among bicyclic graphs

A. Jahanbani, L. Shahbazi, S. M. Sheikholeslami +2

The forgotten topological index of a graph $G$ , denoted by $F (G)$ , is defined as the sum of weights $d (u)^{2} + d (v)^{2}$ over all edges $uv$ of $G$ , where $d (u)$ denotes the degree…

math.CO2020

The Roman (k,k)-domatic number of a graph

A. P. Kazemi, S. M. Sheikholeslami, L. Volkmann

Let $k$ be a positive integer. A {\em Roman $k$ -dominating function} on a graph $G$ is a labeling $f : V (G) ⟶ {0, 1, 2}$ such that every vertex with label 0 has at le…