149 citations · 707 across the 83 of their papers we have counts for
8 papers · 1 filter
On the total and strong version for Roman dominating functions in graphs
S. Nazari-Moghaddam, M. Soroudi, S. M. Sheikholeslami +1
Consider a finite and simple graph with maximum degree . A strong Roman dominating function over the graph is understood as a map $f : V (G)\rightarrow \{0, 1,\ldo…
Outer independent double Roman domination number of graphs
Doost Ali Mojdeh, Babak Samadi, Zehui Shao +1
A double Roman dominating function of a graph is a function having the property that for each vertex with , there exists …
On general position sets in Cartesian products
Sandi Klavžar, Balázs Patkós, Gregor Rus +1
The general position number of a connected graph is the cardinality of a largest set of vertices such that no three distinct vertices from lie on a common…
The general position problem and strong resolving graph
Sandi Klavzar, Ismael G. Yero
The general position number of a connected graph is the cardinality of a largest set of vertices such that no three pairwise distinct vertices from lie on…
Global offensive -alliances in digraphs
Doost Ali Mojdeh, Babak Samadi, Ismael G. Yero
In this paper, we initiate the study of global offensive -alliances in digraphs. Given a digraph , a global offensive -alliance in a digraph is a subset $S…
Quasi-total Roman domination in graphs
Suitberto Cabrera-Garcia, Abel Cabrera-Martinez, Ismael G. Yero
A quasi-total Roman dominating function on a graph is a function satisfying the following: - every vertex for which is adjac…