Paweł Prałat

Multiset metric dimension of binomial random graphs

For a graph G = ( V , E ) and a subset R ⊆ V , we say that R is multiset resolving for G if for every pair of vertices v , w , the multisets [ d ( v , r ) : r ∈ R ] and [ d ( w , r ) : r ∈ R ] are distinct, where d ( x , y ) is the graph distance between vertices x and y . The mu...