Showing 2023Show all
2 papers · 1 filter
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 , let 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…