On some metric properties of supertoken graphs

In this paper, we construct two infinite families of graphs G(d, c) and G+(d, c), where, in both cases, a vertex label is x1x2 . . . xc with xi ∈ {1, 2, . . . , d}. We provide a tight lower bound on the metric dimension of G+(d, c). Moreover, we give the definition and properties of the supertoken g...

Full description

Bibliographic Details
Authors: Baskoro, Edy T., Dalfó, Cristina, Fiol Mora, Miguel Ángel, Simanjuntak, Rinovia
Format: article
Status:Published version
Publication Date:2025
Country:España
Institution:Varias* (Consorci de Biblioteques Universitáries de Catalunya, Centre de Serveis Científics i Acadèmics de Catalunya)
Repository:Recercat. Dipósit de la Recerca de Catalunya
OAI Identifier:oai:recercat.cat:10459.1/468420
Online Access:https://doi.org/10.61091/um123-02
https://hdl.handle.net/10459.1/468420
Access Level:Open access
Keyword:Resolving set
Metric dimension
Token graphs
Supertoken graphs
Radius
Diameter
Description
Summary:In this paper, we construct two infinite families of graphs G(d, c) and G+(d, c), where, in both cases, a vertex label is x1x2 . . . xc with xi ∈ {1, 2, . . . , d}. We provide a tight lower bound on the metric dimension of 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.