On the metric dimension of cartesian products of graphs
A set of vertices S resolves a graph G if every vertex is uniquely determined by its vector of
distances to the vertices in S. The metric dimension of G is the minimum cardinality of a …
distances to the vertices in S. The metric dimension of G is the minimum cardinality of a …
[PDF][PDF] Extremal graph theory for metric dimension and diameter.
Department of Mathematics and Statistics The University of Melbourne Melbourne comma
Australia woodd at unimelb period edu period au Submitted:.. Jul 31 comma 2008 …
Australia woodd at unimelb period edu period au Submitted:.. Jul 31 comma 2008 …
Extremal graph theory for metric dimension and diameter
Let Gβ, D be the set of graphs with metric dimension β and diameter D. The first contribution
is to characterize the graphs in Gβ, D with order β+ D for all values of β and D. The second …
is to characterize the graphs in Gβ, D with order β+ D for all values of β and D. The second …
A study on metric dimension of some families of graphs
A Anuradha, B Amutha - The 11th National Conference on …, 2019 - ui.adsabs.harvard.edu
Abstract Let S⊆ V (G). Then S is said to resolve the whole graph G if every vertex in V (G) is
uniquely determined by its distance-vector to all vertices in the set S. The minimum …
uniquely determined by its distance-vector to all vertices in the set S. The minimum …
On similarity of distances in graphs
A Anuradha, S Swathi - AIP Conference Proceedings, 2019 - pubs.aip.org
A vertex v∈ V (G) that lies at the same distance from at least two distinct vertices u and w is
said to be a distance similar vertex with respect to u and w. A set S⊂ V (G) of vertices is said …
said to be a distance similar vertex with respect to u and w. A set S⊂ V (G) of vertices is said …