Supertoken graphs extend token graphs by permitting multiple tokens per vertex, providing bounds on independence, clique, and chromatic numbers plus a new infinite family of cycle-based graphs whose largest adjacency eigenvalue is studied.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
math.CO 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
Supertoken graphs generalize token graphs under varied token and capacity conditions, yielding families such as Cartesian k-powers of G with basic properties on order, size, and connectivity.
citing papers explorer
-
On supertoken graphs
Supertoken graphs extend token graphs by permitting multiple tokens per vertex, providing bounds on independence, clique, and chromatic numbers plus a new infinite family of cycle-based graphs whose largest adjacency eigenvalue is studied.
-
On Generalized Token Graphs
Supertoken graphs generalize token graphs under varied token and capacity conditions, yielding families such as Cartesian k-powers of G with basic properties on order, size, and connectivity.