Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Melodie Fehr"'
Publikováno v:
aequationes mathematicae. 71:1-18
Let G be a (di)graph and S a set of vertices of G. We say S resolves two vertices u and v of G if d(u, S) ≠ d(v, S). A partition $$ \prod $$ = {P1, P2,..., P k } of V (G) is a resolving partition of G if every two vertices of G are resolved by Pi f
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c268e86de4aa5d683808997b628ce870
https://doi.org/10.1007/s00010-005-2800-z
https://doi.org/10.1007/s00010-005-2800-z
Publikováno v:
Discrete Mathematics. 306:31-41
A vertex x in a digraph D is said to resolve a pair u, v of vertices of D if the distance from u to x does not equal the distance from v to x. A set S of vertices of D is a resolving set for D if every pair of vertices of D is resolved by some vertex
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::68e96bb254211dbdd6a00ae525645570
https://doi.org/10.1016/j.disc.2005.09.015
https://doi.org/10.1016/j.disc.2005.09.015