Relations between the distinguishing number and some other graph parameters
A distinguishing coloring of a simple graph $G$ is a vertex coloring of $G$ which is preserved only by the identity automorphism of $G$. In other words, this coloring ``breaks'' all symmetries of $G$. The distinguishing number $D(G)$ of a graph $G$ is defined to be the smallest number of c...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | fas |
| Published: |
University of Isfahan
2024-11-01
|
| Series: | ریاضی و جامعه |
| Subjects: | |
| Online Access: | https://math-sci.ui.ac.ir/article_28265_6528a64072a5cef6776fc5d046eb8965.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|