On metric dimension of edge comb product of vertex-transitive graphs

Suppose finite graph $G$ is simple, undirected and connected. If $W$ is an ordered set of the vertices such that $|W| = k$, the representation of a vertex $v$ is an ordered $k$-tuple consisting distances of vertex $v$ with every vertices in $W$. The set $W$ is defined as resolving vertex of $G$ if t...

Full description

Bibliographic Details
Main Authors: Tita Maryati, Dindin Sobiruddin, Maifalinda Fatra, Fawwaz Hadiputra
Format: Article
Language:English
Published: University of Isfahan 2024-04-01
Series:Transactions on Combinatorics
Subjects:
Online Access:https://toc.ui.ac.ir/article_28255_9e2fc361e970c9675792e99e7f1f0a79.pdf