Outer multiset dimension of joined graphs
Abstract
The outer multiset dimension of graph G, dimms(G), is the cardinality of the smallest subset S of vertices that uniquely recognizes each vertex outside S by using the multiset of distances between the vertex and the vertices in S. In 2023, Klavzar, Kuziak, and Yero proved that the only graphs with the largest outer multiset dimension, that is, one less than their order, are regular graphs of diameter at most 2. This paper considers the outer multiset dimensions of non-regular graphs of diameter 2 obtained from the join product, in particular, stars, wheels, generalized wheels, windmills, fans, and generalized fans.
Keywords
Full Text:
PDFDOI: http://dx.doi.org/10.19184/ijc.2025.9.2.1
References
N.H. Bong and Y. Lin, Some properties of the multiset dimension of graphs, Electron.J. Graph Theory Appl.. 9, 215–221 (2021)
Gil-Pons, Reynaldo, Y. Ramírez-Cruz, R. Trujillo-Rasua, and I. G. Yero, Distance-based vertex identification in graphs: The outer multiset dimension. Appl. Math. Comput. 363 (2019): 124612.
F. Harary, and R.A. Melter, On the metric dimension of a graph, Ars Combin. 2, 191–195 (1976).
Klavzar, Sandi, D. Kuziak, and I. G. Yero, Further contributions on the outer multiset dimension of graphs, Results Math. 78, 2(2023): 50.
P.J. Slater, Leaves of trees. Cong. Numer. 14, 549–559 (1975).
R. Simanjuntak, T.Vetrik, and P.B. Mulia, The multiset dimension of
graphs, arXiv:1711.00225 [math.CO] (2017).
Tillquist, C. Richard, R.M. Frongillo, and M.E. Lladser, Getting the lay of the land in discrete space: A survey of metric dimension and its applications, SIAM Review 65, 4 (2023): 919-962.
Refbacks
- There are currently no refbacks.

This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.











