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.
Hall, On representatives of subsets,J
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
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.