Reveals the multiset dimension of kayak paddles graph and cycles with chord, implying new insights in graph theory.
Suppose the set W=₁, s₂,, sₖ \ is a subset of the vertex set $V(G)$. The representation of a vertex v of G with respect to W as follows \[r_m(v|W)=\{d(v,s_1), d(v,s_2),, d(v,s_k)\}\] where d(v,sᵢ) is the distance between the vertex v with the vertices of set W together with their multiplicities. The set W is called the { m-resolving set} of G if every vertices of G have distinct representation with respect to W. If G has an m-resolving set, then an m-resolving set having minimum cardinality is called a multiset basis and its cardinality is called the multiset dimension of G, denoted by $md(G)$. We say that G has an infinite multiset dimension and we write md(G)=∞. In this paper, we determine the multiset dimension of kayak paddles graph and cycles with chord.
No takes yet. Share an insight, caveat, or question.
Alfarisi et al. (2026) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: