THE COST NUMBER AND THE DETERMINING NUMBER OF A GRAPH
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 a trivial automorphism. The minimum size of a label class in such a labeling of $G$ with $D(G) = d$ is called the cost of $d$-distinguishing $G$ and...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Shahrood University of Technology
2021-01-01
|
| Series: | Journal of Algebraic Systems |
| Subjects: | |
| Online Access: | http://jas.shahroodut.ac.ir/article_1948_8ed554351047fe89af7fd04bb8a07ed1.pdf |