On some metric properties of supertoken graphs
Combinatorics
2024-12-31 v1
Abstract
In this paper, we construct two infinite families of graphs and , where, in both cases, a vertex label is with . We provide a lower bound on the metric dimension, tight on . Moreover, we give the definition and properties of the supertoken graphs, a generalization of the well-known token graphs. Finally, we provide an upper bound on the metric dimension of supertoken graphs.
Cite
@article{arxiv.2412.20558,
title = {On some metric properties of supertoken graphs},
author = {E. T. Baskoro and C. Dalfó and M. A. Fiol and R. Simanjuntak},
journal= {arXiv preprint arXiv:2412.20558},
year = {2024}
}