M. Korivand

collaborators

3 papers

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.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

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…