@misc{10498/29371,
year = {2022},
month = {12},
url = {http://hdl.handle.net/10498/29371},
abstract = {The outer multiset dimension dim ms(G) of a graph G is the cardinality of a smallest set of vertices that uniquely recognize all the vertices outside this set by using multisets of distances to the set. It is proved that dim ms(G) = n(G) - 1 if and only if G is a regular graph with diameter at most 2. Graphs G with dim ms(G) = 2 are described and recognized in polynomial time. A lower bound on the lexicographic product of G and H is proved when H is complete or edgeless, and the extremal graphs are determined. It is proved that dimms(Ps□Pt)=3 for s≥ t≥ 2.},
publisher = {Springer},
keywords = {grids},
keywords = {lexicographic product of graphs},
keywords = {outer multiset dimension},
keywords = {Outer multiset resolving set},
title = {Further Contributions on the Outer Multiset Dimension of Graphs},
doi = {10.1007/s00025-022-01829-8},
author = {Klavžar, Sandi and Kuziak, Dorota and González Yero, Ismael},
}