Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Dian Kastika Syofyan"'
Publikováno v:
Indonesian Journal of Combinatorics, Vol 4, Iss 2, Pp 126-132 (2020)
The investigation on the locating-chromatic number of a graph was initiated by Char- trand et al. (2002). This concept is in fact a special case of the partition dimension of a graph. This topic has received much attention. However, the results are s
Externí odkaz:
https://doaj.org/article/9485c44b182a46d095c8d65589bb10f4
Publikováno v:
Journal of Mathematical and Fundamental Sciences, Vol 48, Iss 1, Pp 39-47 (2016)
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
Externí odkaz:
https://doaj.org/article/35e9dbcfcf1a45a6a0f3ccb9c83446a2
Publikováno v:
Theoretical Computer Science. 806:305-309
The locating-chromatic number of a graph G ( V , E ) is 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 not con
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6f7296a1788326b419779b713832930a
https://doi.org/10.1016/j.tcs.2019.04.011
https://doi.org/10.1016/j.tcs.2019.04.011
Publikováno v:
ICGTIS
Let G = ( V , E ) be a connected graph. The locating-chromatic number of G , denoted by χ L ( G ), is the cardinality of a minimum locating coloring of the vertex set V ( G ) such that all vertices have distinct coordinates. The results on locating-
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e52c4fb4b7a3d6175bed5e145349c6e6
https://doi.org/10.1016/j.procs.2015.12.079
https://doi.org/10.1016/j.procs.2015.12.079