On some metric properties of supertoken graphs
Abstract
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 lower bound on the metric dimension, tight on 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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.