Papers
Topics
Authors
Recent
Search
2000 character limit reached

On some metric properties of supertoken graphs

Published 29 Dec 2024 in math.CO | (2412.20558v1)

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 $x_1x_2\ldots x_c$ with $x_i\in{1,2,\ldots, 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.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.