Multiset Dimension of Cayley Digraphs of Abelian Groups
Given a set W={w1, w2,...,wk} of vertices of a connected graph or digraph G, the representation multiset of a vertex v in G with respect to W is the multiset rm(v|W)={d(v, w1), d(v, w2),..., d(v, wk)}, where d(v, wi) is the distance from v to wi for i=1,2,..., k. The set W is an m-resolving set of G if rm(u|W)≠ rm(v|W) for any pair of vertices u and v in G. The minimum cardinality of an m-resolving set of G is called the multiset dimension md(G) of G. In this work, we show that md(Cn(1, t))=t for t ≥ 2 and n ≥ 2t2 and md(Cn(1,2,...,t))≤ t for t ≥ 3 and n ≥ 2t. We also prove that the multiset dimension of the Cayley digraph of ℤm ⊕ ℤn with generating set {(1, 0), (0, 1)} is min{m, n} for m, n ≥ 6.
Authors
- Anthony L. Cueno
- Agnes D. Garciano (ORCID: https://orcid.org/0000-0002-0857-5082)
- Reginaldo M. Marcelo (ORCID: https://orcid.org/0000-0003-1958-6489)
Institutions
- University of the Philippines Los Baños (PH)
- Ateneo de Manila University (PH)
Publication Details
- Journal
- Journal of Information Processing
- Published
- 2025-01-01
- DOI
- https://doi.org/10.2197/ipsjjip.33.1056
- Primary Topic
- Graph Labeling and Dimension Problems
- Type
- article
- Field-Weighted Citation Impact
- 0.00