English

On some metric properties of supertoken graphs

Combinatorics 2024-12-31 v1

Abstract

In this paper, we construct two infinite families of graphs G(d,c)G(d,c) and G+(d,c)G^+(d,c), where, in both cases, a vertex label is x1x2xcx_1x_2\ldots x_c with xi{1,2,,d}x_i\in\{1,2,\ldots, d\}. We provide a lower bound on the metric dimension, tight on G+(d,c)G^+(d,c). 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.

Keywords

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}
}