Pith. sign in

REVIEW 2 major objections 4 minor 1 cited by

A Survey on Multiset Dimension and Its Variations

T0 review · 2 major / 4 minor · reviewed 2026-07-10 · grok-4.5

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read This survey consolidates all known results on multiset dimension and its four variants, then proposes new multiset analogues of classical metric parameters.

desk verdict Competent consolidation of multiset-dimension results with three routine new definitions; useful reference once tables are audited, nothing transformative. read the letter →

arxiv 2607.08128 v1 pith:5DAFP6RQ submitted 2026-07-09 math.CO

Azzah Albejani , Yuqing Lin , Joe Ryan , Kiki A. Sugeng This is my paper · ORCID
classification math.CO MSC 05C12
keywords metricdimensionmultisetouterlocaledgeID-coloringresolvingsets
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

Classical metric dimension asks for a smallest set of landmarks so that every vertex has a unique ordered distance vector. Multiset dimension relaxes that requirement: only the multiset of distances must be unique, which is natural when a node can measure distances but cannot tell which landmark produced which measurement. The paper gathers every published exact value, bound, and structural criterion for ordinary multiset dimension and for its four existing variants (local, outer, local-outer, and edge). It also records when the parameter is infinite (twins, diameter at most 2, three or more pendants at one vertex) and notes that computation is NP-complete. Finally it defines three new parameters—multiset partition dimension, local edge multiset dimension, and k-multiset dimension—and lists open questions that would complete the multiset analogue of the classical theory.

What carries the argument

Multiset representation rm(v|S): the unordered multiset of distances from v to the vertices of a landmark set S. A set is multiset-resolving when these multisets are pairwise distinct; its minimum size is the multiset dimension (possibly infinite). All variants modify only which pairs must be distinguished or which objects (vertices versus edges) are being identified.

What would settle it

Publication of a previously overlooked paper that determines the multiset dimension (or one of its four variants) for a standard graph family already listed as open or missing from the survey tables.

Watch

Extended reading notes

Core claim

The multiset-dimension literature is still sparse compared with ordinary metric dimension, yet enough exact results, bounds, and infiniteness criteria already exist for the four known variants that a consolidated survey can serve as a foundation; the authors therefore collect those results into tables and definitions and introduce the natural multiset versions of partition, local-edge, and k-metric dimension as concrete next steps.

Load-bearing premise

That the literature search is complete for the four named variants and that every numerical entry in the tables correctly reproduces the cited theorems.

Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

2 major / 4 minor

Summary. The manuscript surveys the multiset dimension of graphs and its four principal variants (outer, local, local-outer, and edge). After recalling classical metric dimension and several of its well-known extensions, it consolidates existence results, structural bounds, NP-completeness statements, and exact values for standard families into a sequence of lemmas, theorems, and tables (especially Tables 4–8). Section 8 then proposes three new multiset-based parameters—multiset partition dimension, local edge multiset dimension, and k-multiset dimension—as concrete directions for future work. The central claim is therefore organizational: that the existing literature on these four variants has been accurately collected and that the proposed extensions are natural analogues of classical metric-dimension variants.

Significance. Multiset dimension is a comparatively recent and still sparsely studied relaxation of metric dimension; a careful survey that gathers scattered results, unifies notation, and flags open directions is therefore useful to the combinatorial community. The manuscript’s principal strengths are the systematic tables of exact values, the explicit comparison of the four variants with their classical counterparts, and the cleanly labelled proposals in Section 8. Because the paper does not claim new theorems beyond the literature, its value rests entirely on completeness and fidelity of the compilation. If those two conditions hold, the survey will serve as a convenient reference and a stimulus for further work on multiset-type parameters.

major comments (2)
  1. The load-bearing claim of the survey is that Tables 4–8 correctly reproduce every cited theorem and that the literature coverage of the four named variants is essentially complete (Sections 6–7). The manuscript supplies neither a search protocol nor any independent cross-check of table entries against the source papers. Without such verification the consolidation claim remains unconfirmed; a short appendix or supplementary note that lists the precise theorem numbers used for each table row would remove the uncertainty.
  2. Section 8 introduces three new parameters (mpd, local edge multiset dimension, k-multiset dimension) and illustrates mpd with a single example (Figure 2, Table 9). While the definitions are formally well-formed, the section offers almost no comparison with the classical partition dimension, no elementary bounds, and no indication of computational complexity. For a survey that advertises “directions for future work,” a minimal set of basic properties or open questions for each new parameter is needed to make the proposals substantive rather than purely definitional.
minor comments (4)
  1. Notation for the same parameter varies across tables and sections (md, dim_ms, lmd, µl, mde, etc.). A single consistent symbol list at the beginning of Section 5 would improve readability.
  2. Several tables mix results from different papers without indicating which source supplies which entry (e.g., Table 6 rows for amalgamation graphs). Adding a citation column or a footnote would eliminate ambiguity.
  3. Minor typographical issues appear throughout: missing spaces (“Therearenumerousextensions”), inconsistent capitalization of graph names, and occasional undefined symbols (e.g., “gap(md(G),lmd(G))”). A careful copy-edit is required.
  4. The abstract and introduction both contain the same awkward “however” clause; one of the two occurrences should be rephrased.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity: pure literature survey that records prior theorems and proposes new definitions without deriving any claim from its own inputs.

full rationale

The manuscript is a survey. Its central claim is consolidation of already-published results on multiset dimension and four named variants (local, outer, local-outer, edge), together with three clearly labelled proposals for future parameters (multiset partition dimension, local edge multiset dimension, k-multiset dimension). Every numerical statement and bound is attributed to an external citation (Tables 4–8, Theorems 1–25, Lemmas 1–12). No equation is solved, no parameter is fitted, and no uniqueness theorem is imported from the authors’ own prior work to force a conclusion. Self-citations appear only as ordinary bibliographic pointers to earlier papers that themselves contain independent proofs; none of those results is used as an unexamined axiom. The new definitions in Section 8 are introduced as open directions, not as theorems. Consequently the derivation chain is empty of circular steps: the paper simply reports what the literature already contains.

Assumptions & free parameters 0 free parameters · 3 assumptions · 3 invented entities

As a pure survey the paper inherits the standard axioms of finite undirected graph theory and the definitions of distance and multiset representation already fixed in the cited literature. No free parameters are fitted and no new physical or combinatorial entities are postulated beyond three definitional extensions that remain unproved.

assumptions (3)
  • standard math Standard graph-theoretic distance (length of a shortest path) and the usual notions of connectedness, diameter, and line graph.
    Used throughout Sections 2–7 as the background language for all resolving-set definitions.
  • domain assumption The multiset representation of a vertex (or edge) with respect to a landmark set is the multiset of distances to the landmarks.
    Taken as given from Simanjuntak et al. (2017/2018) and subsequent papers; the survey never re-derives it.
  • domain assumption A graph may have infinite multiset dimension when no finite resolving multiset exists (e.g., presence of three pendant vertices or diameter ≤2).
    Recorded as Theorem 7 and Lemma 3 from the literature; treated as established fact.
invented entities (3)
  • multiset partition dimension mpd(G)
    purpose: Proposed analogue of the classical partition dimension that uses multisets of distances to blocks of a partition.
    Defined in Section 8.1 with an illustrative example; no theorems proved, so independent evidence is absent.
  • local edge multiset dimension
    purpose: Local version of edge multiset dimension that only requires incident edges to have distinct multiset representations.
    Definition 8 in Section 8.2; purely definitional, no further results.
  • k-multiset dimension
    purpose: Requires the multiset representations of any two vertices to differ in at least k positions (set-difference size).
    Definition 9; again only a definition, no supporting theory.

how reviews work

0 comments
Cite this review

Pith. "Pith review of A Survey on Multiset Dimension and Its Variations." pith.science (2026). https://pith.science/paper/5DAFP6RQ

@misc{pith2026260708128,
  author       = {Pith},
  title        = {Pith review of: A Survey on Multiset Dimension and Its Variations},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/5DAFP6RQ}},
  note         = {Machine review of arXiv:2607.08128}
}
read the original abstract

The classical notion of metric dimension has led to a wide range of extensions, such as the local, strong, fractional, and k-metric dimensions. This naturally raises the question of whether analogous variants can be formulated and studied within the multiset framework. While some progress has been made, particularly on the local multiset dimension, outer multiset dimension, local outer multiset dimension, and edge multiset dimension, however, the area remains far from fully explored. In this paper, we survey the existing variants and consolidate the results currently available in the literature. Furthermore, we identify several directions for future work.

Figures

Figures reproduced from arXiv: 2607.08128 by the authors.

Figure 1
Figure 1. A tree that satisfies neither of the following: diameter at most [PITH_FULL_IMAGE:figures/full_fig_p012_1.png] view at source ↗
Figure 2
Figure 2. The graph has mpd = 6, with partitions illustrated in the figure. Vertex Multiset partition representation 1 {0, 2, 3, 3, 3, 3} 2 {0, 1, 2, 2, 2, 2} 3 {0, 1, 2, 2, 3, 3} 4 {0, 1, 1, 1, 3, 3} 5 {0, 1, 1, 2, 2, 2} 6 {0, 1, 1, 1, 1, 2} 7 {0, 1, 2, 2, 2, 3} 8 {0, 1, 1, 2, 2, 3} 9 {0, 1, 1, 3, 3, 3} 10 {0, 2, 2, 2, 3, 3} 11 {0, 1, 1, 1, 2, 2} 12 {0, 1, 1, 2, 3, 3} [PITH_FULL_IMAGE:figures/full_fig_p025_2.png] view at source ↗

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. The Multiset Dimension of Graphs: Extremal Values and King Grids

    math.CO 2026-07 accept novelty 8.0 of 10

    Multiset dimension attains the trivial upper bound n(G) for the first time at order 11 (eight graphs), equals 4 on every n×n king grid n ≥ 5, and equals n on every 3×n king strip n ≥ 6.

Reference graph

Works this paper leans on

54 extracted references · 54 canonical work pages · cited by 1 Pith paper

  1. [1]

    Leaves of trees,

    P. J. Slater, “Leaves of trees,”Congr. Numer., vol. 14, pp. 549–559, 1975. 26

    work page 1975

  2. [2]

    On the metric dimension of a graph,

    F. Harary and R. A. Melter, “On the metric dimension of a graph,”Ars Combin., vol. 2, pp. 191–195, 1976

    work page 1976

  3. [3]

    Ontwoproblemsofinformationtheory,

    P.ErdosandA.Rényi, “Ontwoproblemsofinformationtheory,”Magyar Tud. Akad. Mat. Kutató Int. Közl, vol. 8, no. 1–2, pp. 229–243, 1963

    work page 1963

  4. [4]

    Resolvability in graphs and the metric dimension of a graph,

    Chartrand, Gary, Eroh, Linda, Johnson, Mark A, and Oellermann, Or- trud R, “Resolvability in graphs and the metric dimension of a graph,” Discrete Applied Mathematics, vol. 105, no. 1–3, pp. 99–113, 2000, El- sevier

    work page 2000

  5. [5]

    A new technique to uniquely identify the edges of a graph,

    Ikhlaq, Hafiz Muhammad and Ismail, Rashad and Siddiqui, Hafiz Muhammad Afzal and Nadeem, Muhammad Faisal, “A new technique to uniquely identify the edges of a graph,”Symmetry, vol. 15, no. 3, pp. 762, 2023, MDPI

    work page 2023

  6. [6]

    Bondy, J. A. and Murty, U. S. R.,Graph Theory, Springer, New York, 2008, ISBN: 978-1-84628-969-9

    work page 2008

  7. [7]

    Metric dimension related parameters in graphs: A survey on combinatorial, computational and applied results

    Kuziak, Dorota and Yero, Ismael G, “Metric dimension related param- eters in graphs: A survey on combinatorial, computational and applied results,”arXiv preprint arXiv:2107.04877, 2021

    work page Pith review arXiv 2021

  8. [8]

    Getting the lay of the land in discrete space: A survey of metric dimen- sion and its applications,

    Tillquist, Richard C and Frongillo, Rafael M and Lladser, Manuel E, “Getting the lay of the land in discrete space: A survey of metric dimen- sion and its applications,”SIAM Review, vol. 65, no. 4, pp. 919–962, 2023, SIAM

    work page 2023

Show all 54 references
  1. [9]

    A comprehensive survey on the metric dimension problem of graphs and its types,

    Mohamed, Basma, “A comprehensive survey on the metric dimension problem of graphs and its types,”International Journal of Theoretical and Applied Mathematics, vol. 9, no. 1, pp. 1–5, 2023

    2023

  2. [10]

    Strongmetricdimension: asurvey,

    Kratica, Jozef and Kovačević-Vujčić, Vera and Čangalović, Mirjana and Mladenović, Nenad, “Strongmetricdimension: asurvey,”Yugoslav Jour- nal of Operations Research, vol. 24, no. 2, pp. 187–198, 2014

    2014

  3. [11]

    The partition dimension of a graph,

    Chartrand, Gary and Salehi, Ebrahim and Zhang, Ping, “The partition dimension of a graph,”Aequationes mathematicae, vol. 59, no. 1, pp. 45–54, 2000, Springer. 27

    2000

  4. [12]

    Uniquely identifying the edges of a graph: the edge metric dimension,

    Kelenc, Aleksander and Tratnik, Niko and Yero, Ismael G, “Uniquely identifying the edges of a graph: the edge metric dimension,”Discrete Applied Mathematics, vol. 251, pp. 204–220, 2018, Elsevier

    2018

  5. [13]

    Edge metric dimen- sion of graphs,

    Nasir, Ruby and Zafar, Sohail and Zahid, Zohaib, “Edge metric dimen- sion of graphs,”Ars Combinatoria -Waterloo then Winnipeg-, 2018

    2018

  6. [14]

    Basesize, metricdimensionand other invariants of groups and graphs,

    Bailey, RobertFandCameron, PeterJ,“Basesize, metricdimensionand other invariants of groups and graphs,”Bulletin of the London Mathe- matical Society, vol. 43, no. 2, pp. 209–242, 2011, Wiley Online Library

    2011

  7. [15]

    On the metric dimension of line graphs,

    Feng, Min and Xu, Min and Wang, Kaishun, “On the metric dimension of line graphs,”Discrete Applied Mathematics, vol. 161, no. 6, pp. 802– 805, 2013, Elsevier

    2013

  8. [16]

    Onthemetricdimensionofcartesianproductsofgraphs,

    Cáceres, José and Hernando, Carmen and Mora, Merce and Pelayo, Ignacio M and Puertas, María L and Seara, Carlos and Wood, David R, “Onthemetricdimensionofcartesianproductsofgraphs,”SIAM journal on discrete mathematics, vol. 21, no. 2, pp. 423–441, 2007, SIAM

    2007

  9. [17]

    Metric dimension and zero forcing number of two families of line graphs,

    Eroh, Linda and Kang, Cong X and Yi, Eunjeong, “Metric dimension and zero forcing number of two families of line graphs,”arXiv preprint arXiv:1207.6127, 2012

    2012 arXiv

  10. [18]

    The local met- ric dimension of a graph,

    Okamoto, Futaba and Phinezy, Bryan and Zhang, Ping, “The local met- ric dimension of a graph,”Mathematica Bohemica, vol. 135, no. 3, pp. 239–255, 2010, Institute of Mathematics, Academy of Sciences of the Czech Republic

    2010

  11. [19]

    Local metric dimension of cer- tain wheel related graphs,

    Fancy, VF and Cynthia, V Jude Annie, “Local metric dimension of cer- tain wheel related graphs,”Int. J. Math. Comput. Sci, vol. 16, no. 4, pp. 1303–1315, 2021

    2021

  12. [20]

    The local multiset dimension of graphs,

    Ridho Alfarisi and Dafik and Arika Indah Kristiana and Ika Hesti Agustin, “The local multiset dimension of graphs,”In- ternational Journal of Engineering & Technology, vol. 8, no. 3, pp. 120–124, 2019, Science Publishing Corporation, URL: http://www.sciencepubco.com/index.php/IJET. 28

    2019

  13. [21]

    Mixed metric dimension of graphs,

    Kelenc, Aleksander and Kuziak, Dorota and Taranenko, Andrej and Yero, Ismael G, “Mixed metric dimension of graphs,”Applied Mathe- matics and Computation, vol. 314, pp. 429–438, 2017, Elsevier

    2017

  14. [22]

    The metric dimension of the lexicographic product of graphs,

    Jannesari, Mohsen and Omoomi, Behnaz, “The metric dimension of the lexicographic product of graphs,”Discrete mathematics, vol. 312, no. 22, pp. 3349–3356, 2012, Elsevier

    2012

  15. [23]

    Onmetricgeneratorsofgraphs,

    Sebő, AndrásandTannier, Eric, “Onmetricgeneratorsofgraphs,”Math- ematics of Operations Research, vol. 29, no. 2, pp. 383–393, 2004, IN- FORMS

    2004

  16. [24]

    On the strong partition dimension of graphs,

    Yero, Ismael González, “On the strong partition dimension of graphs,” arXiv preprint arXiv:1312.1987, 2013

    1987 arXiv

  17. [25]

    The k-metric dimension,

    Adar, Ron and Epstein, Leah, “The k-metric dimension,”Journal of Combinatorial Optimization, vol. 34, pp. 1–30, 2017, Springer

    2017

  18. [26]

    The k-metric dimension of a graph,

    Estrada-Moreno, Alejandro and Rodríguez-Velázquez, Juan A and Yero, Ismael G, “The k-metric dimension of a graph,”arXiv preprint arXiv:1312.6840, 2013

    2013 arXiv

  19. [27]

    Thefractionalmetricdimension of graphs,

    Arumugam, SandMathew, Varughese, “Thefractionalmetricdimension of graphs,”Discrete Mathematics, vol. 312, no. 9, pp. 1584–1590, 2012, Elsevier

    2012

  20. [28]

    The fractional strong metric dimen- sion of graphs,

    Kang, Cong X and Yi, Eunjeong, “The fractional strong metric dimen- sion of graphs,”International Conference on Combinatorial Optimiza- tion and Applications, pp. 84–95, 2013, Springer

    2013

  21. [29]

    k-metric antidimension: A privacy measure for social graphs,

    Trujillo-Rasua, Rolando and Yero, Ismael G, “k-metric antidimension: A privacy measure for social graphs,”Information Sciences, vol. 328, pp. 403–417, 2016, Elsevier

    2016

  22. [30]

    The mul- tiset dimension of graphs,

    Simanjuntak Rinovia and Siagian, Presli and Vetrik, Tomas, “The mul- tiset dimension of graphs,”arXiv preprint arXiv:1711.00225, 2017

    2017 arXiv

  23. [31]

    Some properties of the multiset di- mension of graphs.,

    Bong, Novi H and Lin, Yuqing, “Some properties of the multiset di- mension of graphs.,”Electron. J. Graph Theory Appl., vol. 9, no. 1, pp. 215–221, 2021. 29

    2021

  24. [32]

    A note on multiset dimension and local multiset di- mension of graphs,

    Alfarisi, Ridho and Lin, Yuqing and Ryan, Joe and Dafik, Dafik and Agustin, Ika Hesti, “A note on multiset dimension and local multiset di- mension of graphs,”Statistics, Optimization & Information Computing, vol. 8, no. 4, pp. 890–901, 2020

    2020

  25. [33]

    Multi- set dimensions of trees,

    Hafidh, YusufandKurniawan, RizkiandSaputro, SuhadiandSimanjun- tak, Rinovia and Tanujaya, Steven and Uttunggadewa, Saladin, “Multi- set dimensions of trees,”arXiv preprint arXiv:1908.05879, 2019

    1908 arXiv

  26. [34]

    Multiset Dimension of Prisms,

    Marcelo, Reginaldo M and Garciano, Agnes D and Buot, Jude Cabi- gas and Tolentino, Mark Anthony C, “Multiset Dimension of Prisms,” Communications in Combinatorics and Optimization, 2025, Azarbaijan Shahid Madani University

    2025

  27. [35]

    On multiset dimension of cylindrical graphs,

    Marcelo, Reginaldo M and Tolentino, Mark Anthony C and Garciano, Agnes D and Buot, Jude C, “On multiset dimension of cylindrical graphs,”J. COMBIN. MATH. COMBIN. COMPUT, vol. 126, no. 225, pp. 240, 2025

    2025

  28. [36]

    Distance vertex identification in graphs,

    Chartrand, Gary and Kono, Yuya and Zhang, Ping, “Distance vertex identification in graphs,”Journal of Interconnection Networks, vol. 21, no. 01, pp. 2150005, 2021, World Scientific

    2021

  29. [37]

    Vertex identification in trees,

    Kono, Yuya and Zhang, Ping, “Vertex identification in trees,”Discrete Math. Lett, vol. 7, no. 66–73, pp. 2022, 2021

    2022

  30. [38]

    A note on the identification numbers of caterpillars,

    Kono, Yuya and Zhang, Ping, “A note on the identification numbers of caterpillars,”Discrete Math. Lett, vol. 8, pp. 10–15, 2022

    2022

  31. [39]

    Vertex identification in grids and prisms,

    Kono, Yuya and Zhang, Ping, “Vertex identification in grids and prisms,” Journal of Interconnection Networks, vol. 22, no. 02, pp. 2150019, 2022, World Scientific

    2022

  32. [40]

    On the vertex identi- fication spectra of grids,

    Marcelo, Reginaldo M and Tolentino, Mark Anthony C and Garciano, Agnes D and Ruiz, Mari-Jo P and Buot, Jude C, “On the vertex identi- fication spectra of grids,”Journal of Interconnection Networks, vol. 25, no. 01, pp. 2450002, 2025, World Scientific

    2025

  33. [41]

    The identification numbers of lollipop graphs,

    Cai, Gaixiang and Xiao, Fengru and Yu, Guidong, “The identification numbers of lollipop graphs,”AIMS Mathematics, vol. 10, no. 4, pp. 7813–7827, 2025, American Institute of Mathematical Sciences. 30

    2025

  34. [42]

    Graph identification index,

    Wang, Runze, “Graph identification index,”arXiv preprint arXiv:2410.07019, 2024

    2024 arXiv

  35. [43]

    Complexity and Equivalency of Multiset Dimension and ID-colorings,

    Hakanen, Anni and Yero, Ismael G, “Complexity and Equivalency of Multiset Dimension and ID-colorings,”Fundamenta Informaticae, vol. 191, no. 3–4, pp. 315–330, 2024, SAGE Publications Sage UK: London, England

    2024

  36. [44]

    Distance-based vertex identification in graphs: The outer multiset dimension,

    Gil-Pons, Reynaldo and Ramírez-Cruz, Yunior and Trujillo-Rasua, Rolando and Yero, Ismael G, “Distance-based vertex identification in graphs: The outer multiset dimension,”Applied Mathematics and Com- putation, vol. 363, pp. 124612, 2019, Elsevier

    2019

  37. [45]

    Further con- tributions on the outer multiset dimension of graphs,

    Klavžar, Sandi and Kuziak, Dorota and Yero, Ismael G, “Further con- tributions on the outer multiset dimension of graphs,”Results in Math- ematics, vol. 78, no. 2, pp. 50, 2023, Springer

    2023

  38. [46]

    Local (Outer) Multiset Dimensions of Graphs,

    Simanjuntak, Rinovia and Hasan, M Ali and Anggarawan, Muhung, “Local (Outer) Multiset Dimensions of Graphs,”arXiv preprint arXiv:2507.15071, 2025

    2025 arXiv

  39. [47]

    On the Local Multiset Dimension of Comb Product Graphs,

    Alfarisi, Ridho and Susilowati, Liliek and Kristiana, Arika Indah, “On the Local Multiset Dimension of Comb Product Graphs,”Statistics, Op- timization & Information Computing, vol. 14, no. 3, pp. 1356–1361, 2025

    2025

  40. [48]

    On the local multiset dimension of m-shadow graph,

    Adawiyah, R and Agustin, IH and Prihandini, RM and Alfarisi, R and Albirri, ER and others, “On the local multiset dimension of m-shadow graph,”Journal of Physics: Conference Series, vol. 1211, no. 1, pp. 012006, 2019, IOP Publishing

    2019

  41. [49]

    Local multiset dimension of amalgamation graphs,

    Alfarisi, Ridho and Susilowati, Liliek and Dafik, Dafik and Prabhu, Savari, “Local multiset dimension of amalgamation graphs,” F1000Research, vol. 12, pp. 95, 2024

    2024

  42. [50]

    On the local multiset dimension of graph with homogenous pendant edges,

    Adawiyah, R and Agustin, IH and Prihandini, RM and Alfarisi, R and Albirri, ER and others, “On the local multiset dimension of graph with homogenous pendant edges,”Journal of Physics: Conference Series, vol. 1538, no. 1, pp. 012023, 2020, IOP Publishing. 31

    2020

  43. [51]

    On the local multiset dimension of some families of graphs,

    Alfarisi, Ridho and Susilowati, Liliek and DAFIK, OSAYE J and Os- aye, FJ, “On the local multiset dimension of some families of graphs,” WSEAS Trans. Math, vol. 22, pp. 64–69, 2023

    2023

  44. [52]

    The Local Multiset Resolving of Graphs. 2022,

    Alfarisi, R and SusilowatiDafik, L, “The Local Multiset Resolving of Graphs. 2022,” Review

    2022

  45. [53]

    The local multiset dimension of unicyclic graph,

    Adawiyah, Robiatul and Prihandini, RM and Albirri, ER and Agustin, IH and Alfarisi, R and others, “The local multiset dimension of unicyclic graph,”IOP Conference Series: Earth and Environmental Science, vol. 243, no. 1, pp. 012075, 2019, IOP Publishing

    2019

  46. [54]

    Some properties of the multiset di- mension of graphs.,

    Bong, Novi H and Lin, Yuqing, “Some properties of the multiset di- mension of graphs.,”Electron. J. Graph Theory Appl., vol. 9, no. 1, pp. 215–221, 2021. 32

    2021

Pith tools

Reviewed July 10, 2026 · model on record in the stance chip above.