Trees with Certain Locating-chromatic Number
The locating-chromatic number of a graph G can be defined as the cardinality of a minimum resolving partition of the vertex set V(G) such that all vertices have distinct coordinates with respect to this partition and every two adjacent vertices in G are not contained in the same partition class. In...
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Artigo |
| Lenguaje: | Inglês |
| Publicado: |
ITB Journal Publisher
2016-03-01
|
| Colección: | Journal of Mathematical and Fundamental Sciences |
| Materias: | |
| Acceso en línea: | http://journals.itb.ac.id/index.php/jmfs/article/view/1470 |
| Etiquetas: |
Sin Etiquetas, Sea el primero en etiquetar este registro!
|