Vertices, edges, distances and metric dimension in graphs
暂无分享,去创建一个
Abstract Given a connected graph G = ( V , E ) , a set of vertices S ⊂ V is an edge metric generator for G , if any two edges of G are identified by S by mean of distances to the vertices in S . Moreover, in a natural way, S is a mixed metric generator, if any two elements of G (vertices or edges) are identified by S by mean of distances. In this work we study the (edge and mixed) metric dimension of graphs.
[1] Ismael González Yero,et al. Uniquely identifying the edges of a graph: The edge metric dimension , 2016, Discret. Appl. Math..
[2] Ismael González Yero,et al. Mixed metric dimension of graphs , 2016, Appl. Math. Comput..
[3] Gary Chartrand,et al. Resolvability in graphs and the metric dimension of a graph , 2000, Discret. Appl. Math..
[4] N. Duncan. Leaves on trees , 2014 .