Sign Up to like & get
recommendations!
1
Published in 2018 at "Mathematics"
DOI: 10.3390/math6100191
Abstract: Let G = (V, E) be a connected graph and d(x, y) be the distance between the vertices x and y in G. A set of vertices W resolves a graph G if every vertex…
read more here.
Keywords:
graphs;
dimensions symmetric;
rooted product;
metric dimension ... See more keywords