B. Samadi

activity

20122024

most citedOn three outer-independent domination related parameters in graphs

16 citations · 106 across the 28 of their papers we have counts for

collaborators

28 papers

math.CO2024

Injective colorings of Sierpiński-like graphs and Kneser graphs

Boštjan Brešar, Sandi Klavžar, Babak Samadi +1

Two relationships between the injective chromatic number and, respectively, chromatic number and chromatic index, are proved. They are applied to determine the injective chromatic…

math.CO2023

Limited packings: related vertex partitions and duality issues

Azam Sadat Ahmadi, Nasrin Soltankhah, Babak Samadi

A $k$ -limited packing partition ( $k$ LP partition) of a graph $G$ is a partition of $V (G)$ into $k$ -limited packing sets. We consider the $k$ LP partitions with minimum cardinality (…

math.CO2023★ 2 cited

Injective coloring of product graphs

Babak Samadi, Nasrin Soltankhah, Ismael G. Yero

The problem of injective coloring in graphs can be revisited through two different approaches: coloring the two-step graphs and vertex partitioning of graphs into open packing sets…

math.CO2022

Further results on outer independent $2$ -rainbow dominating functions of graphs

Babak Samadi, Nasrin Soltankhah

Let $G = (V (G), E (G))$ be a graph. A function $f : V (G) \to P ({1, 2})$ is a $2$ -rainbow dominating function if for every vertex $v$ with $f (v) = \emptyset$ , $f\big{(}N(v)…

math.CO2021

Revisiting $k$ -tuple dominating sets with emphasis on small values of $k$

Babak Samadi, Nasrin Soltankhah, Doost Ali Mojdeh

For any graph $G$ of order $n$ with degree sequence $d_{1} \geq \dots \geq d_{n}$ , we define the double Slater number $s ℓ_{\times 2} (G)$ as the smallest integer $t$ such that $t+d_…

math.CO2021★ 5 cited

Restrained condition on double Roman dominating functions

Babak Samadi, Nasrin Soltankhah, H. Abdollahzadeh Ahangar +4

We continue the study of restrained double Roman domination in graphs. For a graph $G=\big{(}V(G),E(G)\big{)}$, a double Roman dominating function $f$ is called a restrained double…

math.CO2021★ 10 cited

Injective coloring of graphs revisited

Boštjan Brešar, Babak Samadi, Ismael G. Yero

An open packing in a graph $G$ is a set $S$ of vertices in $G$ such that no two vertices in $S$ have a common neighbor in $G$ . The injective chromatic number $χ_{i} (G)$ of $G$ is the…

math.CO2020★ 15 cited

Restrained Italian domination in graphs

Babak Samadi, Morteza Alishahi, Iman Masoumi +1

For a graph $G = (V (G), E (G))$ , an Italian dominating function (ID function) $f : V (G) \to {0, 1, 2}$ has the property that for every vertex $v \in V (G)$ with $f (v) = 0$ , either $v$ …

math.CO2020★ 7 cited

Covering Italian domination in graphs

Abdollah Khodkar, Doost Ali Mojdeh, Babak Samadi +1

For a graph $G = (V (G), E (G))$ , an Italian dominating function (ID function) of $G$ is a function $f : V (G) \to {0, 1, 2}$ such that for each vertex $v \in V (G)$ with $f (v) = 0$ , $f…

math.GM2019★ 12 cited

Outer independent double Roman domination number of graphs

Doost Ali Mojdeh, Babak Samadi, Zehui Shao +1

A double Roman dominating function of a graph $G$ is a function $f : V (G) \to {0, 1, 2, 3}$ having the property that for each vertex $v$ with $f (v) = 0$ , there exists $u \in N (v)$ …

math.CO2019★ 1 cited

Double domination and total $2$ -domination in digraphs and their dual problems

Doost Ali Mojdeh, Babak Samadi

A subset $S$ of vertices of a digraph $D$ is a double dominating set (total $2$ -dominating set) if every vertex not in $S$ is adjacent from at least two vertices in $S$ , and every…

math.CO2019★ 1 cited

Global offensive $k$ -alliances in digraphs

Doost Ali Mojdeh, Babak Samadi, Ismael G. Yero

In this paper, we initiate the study of global offensive $k$ -alliances in digraphs. Given a digraph $D = (V (D), A (D))$ , a global offensive $k$ -alliance in a digraph $D$ is a subset $S…

math.CO2019★ 1 cited

(Open) packing number of some graph products

Doost Ali Mojdeh, Iztok Peterin, Babak Samadi +1

The packing number of a graph $G$ is the maximum number of closed neighborhoods of vertices in $G$ with pairwise empty intersections. Similarly, the open packing number of $G$ is t…

math.CO2018★ 16 cited

On three outer-independent domination related parameters in graphs

Doost Ali Mojdeh, Iztok Peterin, Babak Samadi +1

Let $G$ be a graph and let $S \subseteq V (G)$ . The set $S$ is a double outer-independent dominating set of $G$ if $∣ N [v] \cap D ∣ \geq 2$ , for all $v \in V (G)$ , and $V (G) ∖ S$ is…

math.CO2018

Bounds on the nonnegative signed domination number of graphs

Doost Ali Mojdeh, Babak Samadi, Lutz Volkmann

The aim of this work is to investigate the nonnegative signed domination number $γ_{s}^{N N}$ with emphasis on regular, ( $r + 1$ )-clique-free graphs and trees. We give lower and upper b…

math.CO2018

Some notes on the signed bad number in bipartite graphs

Doost Ali Mojdeh, Babak Samadi

In this paper, we deal with the signed bad number and the negative decision number of graphs. We show that two upper bounds concerning these two parameters for bipartite graphs in…

math.CO2018★ 4 cited

Packing and domination parameters in digraphs

Doost Ali Mojdeh, Babak Samadi, Ismael G. Yero

Given a digraph $D = (V, A)$ , a set $B \subset V$ is a packing set in $D$ if there are no arcs joining vertices of $B$ and for any two vertices $x, y \in B$ the sets of in-neighbors of $…

math.CO2017★ 1 cited

On the packing numbers in graphs

D. A. Mojdeh, B. Samadi, A. Khodkar +1

In this paper, we find upper bounds on the open packing and $k$ -limited packing numbers with emphasis on the cases $k = 1$ and $k = 2$ . We solve the problem of characterizing all conne…

math.CO2017★ 5 cited

Packing parameters in graphs: New bounds and a solution to an open problem

D. A. Mojdeh, Babak Samadi

In this paper, we investigate the packing parameters in graphs. By applying the Mantel's theorem, We give upper bounds on packing and open packing numbers of triangle-free graphs a…

math.CO2016

Nordhaus-Gaddum type inequalities for multiple domination and packing parameters in graphs

D. A. Mojdeh, Babak Samadi, Lutz Volkmann

We study the Nordhaus-Gaddum type results for $(k - 1, k, j)$ and $k$ -domination numbers of a graph $G$ and investigate these bounds for the $k$ -limited packing and $k$ -total limited p…

math.GN2016★ 2 cited

Weak and strong structures and the $T_{3.5}$ property for generalized topological spaces

E. Makai, E. Peyghan, B. Samadi

We investigate weak and strong structures for generalized topological spaces, among others products, sums, subspaces, quotients, and the complete lattice of generalized topologies…

math.CO2016★ 1 cited

On the inverse signed total domination number in graphs

D. A. Mojdeh, Babak Samadi

In this paper, we study the inverse signed total domination number in graphs and present new lower and upper bounds on this parameter. For example by making use of the classic theo…

math.CO2015★ 2 cited

New bounds on the signed total domination number of graphs

S. M. Hosseini Moghaddam, D. A. Mojdeh, Babak Samadi +1

In this paper, we study the signed total domination number in graphs and present new sharp lower and upper bounds for this parameter. For example by making use of the classic theor…

math.CO2014

$(k, k^{'}, k^{''})$ -domination in graphs

Abdollah Khodkar, Babak Samadi, H. R. Golmohammadi

We first introduce the concept of (k,k',k'')-domination numbers in graphs, which is a generalization of many domination parameters. Then we find lower and upper bounds for this par…

Injective colorings of Sierpiński-like graphs and Kneser graphs

Limited packings: related vertex partitions and duality issues

Injective coloring of product graphs

Further results on outer independent 2-rainbow dominating functions of graphs

Revisiting k-tuple dominating sets with emphasis on small values of k

Restrained condition on double Roman dominating functions

Injective coloring of graphs revisited

Restrained Italian domination in graphs

Covering Italian domination in graphs

Outer independent double Roman domination number of graphs

Double domination and total 2-domination in digraphs and their dual problems

Global offensive k-alliances in digraphs

(Open) packing number of some graph products

On three outer-independent domination related parameters in graphs

Bounds on the nonnegative signed domination number of graphs

Some notes on the signed bad number in bipartite graphs

Packing and domination parameters in digraphs

On the packing numbers in graphs

Packing parameters in graphs: New bounds and a solution to an open problem

Nordhaus-Gaddum type inequalities for multiple domination and packing parameters in graphs

Weak and strong structures and the T3.5​ property for generalized topological spaces

On the inverse signed total domination number in graphs

New bounds on the signed total domination number of graphs

(k,k′,k′′)-domination in graphs

Further results on outer independent $2$ -rainbow dominating functions of graphs

Revisiting $k$ -tuple dominating sets with emphasis on small values of $k$

Double domination and total $2$ -domination in digraphs and their dual problems

Global offensive $k$ -alliances in digraphs

Weak and strong structures and the $T_{3.5}$ property for generalized topological spaces

$(k, k^{'}, k^{''})$ -domination in graphs