The chromatic distinguishing index of certain graphs
The distinguishing index of a graph , denoted by , is the least number of labels in an edge coloring of not preserved by any non-trivial automorphism. The distinguishing chromatic index of a graph is the least number such that has a proper edge coloring with labels that is preserved only by the iden...
Na minha lista:
| Principais autores: | , |
|---|---|
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado em: |
Taylor & Francis Group
2020-01-01
|
| coleção: | AKCE International Journal of Graphs and Combinatorics |
| Assuntos: | |
| Acesso em linha: | http://dx.doi.org/10.1016/j.akcej.2019.03.008 |
| Tags: |
Sem tags, seja o primeiro a adicionar uma tag!
|