on the graphs with distinguishing number equal list distinguishing number

The distinguishing number $d(g)$ of a graph $g$ is the least integer $d$ such that $g$ has an vertex labeling with $d$ labels that is preserved only by the trivial automorphism. a list assignment to $g$ is an assignment $l = {l(v)}_{vin v (g)}$ of lists of labels to the vertices of $g$. a distinguishing $l$-labeling of $g$ is a distinguishing labeling of $g$ where the label of each vertex $v$ comes from $l(v)$. the list distinguishing number of $g$, $d_l(g)$ is the minimum $k$ such that every list assignment to $g$ in which $|l(v)| = k$ for all $v in v (g)$ yields a distinguishing $l$-labeling of $g$. in this paper, we determine the list-distinguishing number for two families of graphs. we also characterize graphs with the distinguishing number equal the list distinguishing number. finally, we show that this characterization works for other list numbers of a graph.