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)\}_{v\in V (G)}$ of lists of labels to the vertices of $G$. A disting...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Shahid Bahonar University of Kerman
2023-05-01
|
| Series: | Journal of Mahani Mathematical Research |
| Subjects: | |
| Online Access: | https://jmmrc.uk.ac.ir/article_3600_cc4639fb15e938c1c80b65597842996c.pdf |