RT journal article
T1 Further Contributions on the Outer Multiset Dimension of Graphs
A1 Klavžar, Sandi
A1 Kuziak, Dorota
A1 González Yero, Ismael
A2 Estadística e Investigación Operativa
A2 Matemáticas
K1 grids
K1 lexicographic product of graphs
K1 outer multiset dimension
K1 Outer multiset resolving set
AB 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.
PB Springer
SN 1422-6383
YR 2022
FD 2022-12-31
LK http://hdl.handle.net/10498/29371
UL http://hdl.handle.net/10498/29371
LA eng
DS Repositorio Institucional de la Universidad de Cádiz
RD 11-nov-2026