On generalized token graphs

doi:10.2298/FIL2602721S

On generalized token graphs

2026-01-01

0

PRE

AI

DOI：10.2298/FIL2602721S

Original

Original request for help

Save

Abstract

En 中文

The vertices of a k-token graph of a graph G correspond to k indistinguishable tokens placed on k different vertices of G. Changing some conditions on both the nature of the tokens and the number of tokens allowed in each vertex of G, we define a generalization of token graphs, which we call generalized token graphs or simply supertoken graphs, which have different applications. Depending on the above conditions, different families of graphs (such as the Cartesian k-th power of G by itself) are obtained, and we present some of their properties, including order, size, and connectivity.

Keywords:

Token graph

Cartesian product

connectivity

On generalized token graphs

Abstract

Journal

Organization

Cited Papers