N. Soltankhah

collaborators

2 papers

math.CO2025

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…