N. Soltankhah

activity

20082026

most citedOn the non-existence of some Steiner

t

(v, k)

trades of certain volumes

6 citations · 27 across the 24 of their papers we have counts for

collaborators

25 papers

math.CO2026

Subgroup Perfect Codes in Bi-Cayley Graphs

Masoumeh Koohestani, Nasrin Soltankhah, Mohsen Ghasemi

In this paper, we study perfect codes in bi-Cayley graphs, focusing on when two subgroups $H$ and $K$ of a group G can form a perfect code of the form $H_{0} \cup K_{1}$ . We first cons…

math.CO2024

Breaking Symmetry in Graphs by Resolving Sets

Meysam Korivand, Nasrin Soltankhah, Sandi Klavžar

Let $dim (G)$ and $D (G)$ respectively denote the metric dimension and the distinguishing number of a graph $G$ . It is proved that $D (G) \leq dim (G) + 1$ holds for every con…

math.CO2024

On k-(total) limited packing in graphs

Azam Sadat Ahmadi, Nasrin Soltankhah

A set $B \subseteq V (G)$ is called a $k$ -total limited packing set in a graph $G$ if $∣ B \cap N (v) ∣ \leq k$ for any vertex $v \in V (G)$ . The $k$ -total limited packing number $L_{k,t}(G…

math.CO2023

A Connection between Metric Dimension and Distinguishing Number of Graphs

Meysam Korivand, Nasrin Soltankhah

In this paper, we introduce a connection between two classical concepts of graph theory: \; metric dimension and distinguishing number. For a given graph $G$ , let $dim (G)$ an…

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

Uniquely Distinguishing Colorable Graphs

M. Korivand, N. Soltankhah, K. Khashyarmanesh

A graph is called uniquely distinguishing colorable if there is only one partition of vertices of the graph that forms distinguishing coloring with the smallest possible colors. In…