6 citations · 16 across the 17 of their papers we have counts for
20 papers
Breaking Symmetry in Graphs by Resolving Sets
Meysam Korivand, Nasrin Soltankhah, Sandi Klavžar
Let and respectively denote the metric dimension and the distinguishing number of a graph . It is proved that holds for every con…
On k-(total) limited packing in graphs
Azam Sadat Ahmadi, Nasrin Soltankhah
A set is called a -total limited packing set in a graph if for any vertex . The -total limited packing number $L_{k,t}(G…
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 , let an…
Limited packings: related vertex partitions and duality issues
Azam Sadat Ahmadi, Nasrin Soltankhah, Babak Samadi
A -limited packing partition (LP partition) of a graph is a partition of into -limited packing sets. We consider the LP partitions with minimum cardinality (…
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…
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…