Relationship between radio k-chromatic number of graphs and square graphs
Let be a simple connected graph with diameter d(G) and k be a positive integer. A radio k-labeling of G is a function such that holds for each pair of distinct vertices u and v of G, where is the distance between u and v in G. The absolute difference of the largest and smallest values in is termed a...
Guardado en:
| Autor principal: | |
|---|---|
| Formato: | article |
| Lenguaje: | EN |
| Publicado: |
Taylor & Francis Group
2021
|
| Materias: | |
| Acceso en línea: | https://doaj.org/article/598a864d47d944e5b583d985cdd4f7cb |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| Sumario: | Let be a simple connected graph with diameter d(G) and k be a positive integer. A radio k-labeling of G is a function such that holds for each pair of distinct vertices u and v of G, where is the distance between u and v in G. The absolute difference of the largest and smallest values in is termed as the span of f, and is denoted by The minimum span amongst all radio k-labelings of G is the radio k-chromatic number of G and it is denoted by In this article, we investigate a relationship between the radio k-chromatic number of an arbitrary graph and its square graph. This investigation leads us to the exact value of the radio number for square of graphs with small triameter. |
|---|