A New Game Invariant of Graphs: the Game Distinguishing Number
The distinguishing number of a graph $G$ is a symmetry related graph invariant whose study started two decades ago. The distinguishing number $D(G)$ is the least integer $d$ such that $G$ has a $d$-distinguishing coloring. A distinguishing $d$-coloring is a coloring $c:V(G)\rightarrow\{1,...,d\}$ in...
Guardat en:
| Autors principals: | , , , |
|---|---|
| Format: | Artigo |
| Idioma: | Inglês |
| Publicat: |
Discrete Mathematics & Theoretical Computer Science
2017-03-01
|
| Col·lecció: | Discrete Mathematics & Theoretical Computer Science |
| Matèries: | |
| Accés en línia: | https://dmtcs.episciences.org/1303/pdf |
| Etiquetes: |
Sense etiquetes, Sigues el primer a etiquetar aquest registre!
|