Pedro M. M. de Castro

Edge multiset dimension of subdivided complete graphs

Distances from an edge to selected vertices, called landmarks, can identify the edge; each distance is measured from its nearer endpoint. We study how many landmarks are needed when the values and their repetitions are retained but the landmark names are removed. In a complete gr...

Edge multiset dimension of subdivided complete graphs

A vertex set resolves the edges of a graph by multisets if the multiplicities of distances to its vertices distinguish every edge. We study the minimum size of such a set for complete graphs whose edges are replaced by paths of a common length. When that length is five, we prove...