
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.
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 20 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Top 10% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
