4 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…
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…
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…
On the comparison of the distinguishing coloring and the locating coloring of graphs
M. Korivand, A. Erfanian, Edy T. Baskoro
Let G be a simple connected graph. Then chi L(G) and chi D(G) will denote the locating chromatic number and the distinguishing chromatic number of G, respectively. In this paper, w…