Token graphs of stars
arXiv:2611.11191
Abstract
The -token graph of a graph has as vertices the -subsets of , two of them being adjacent when their symmetric difference is an edge of . Let be the star with leaves. Since every edge of is incident with the center, is the inclusion graph of the - and the -subsets of the leaves. We use this identification to determine its diameter, radius, girth, Wiener index and number of spanning trees, and to decompose into and joined by a matching; the parameters of that are already known, such as its connectivity, independence number, automorphism group and spectrum, are collected in an appendix. The two parameters that the identification does not settle are the domination and the packing numbers. For the domination number we prove, for fixed , that , where is the Turan density of the complete -uniform hypergraph on vertices; for both constants are equal to , so that , and the upper bound takes the exact form , which is attained for all . For we improve the upper bound to , which matches the lower bound if Turan's conjecture holds. We show that the packing number of equals the maximum size of a binary constant-weight code, and we characterize when the packing and the domination numbers coincide, namely, for , exactly when and a Steiner system exists; in that case both parameters equal the Catalan number .
arXiv comment42 pages, 3 figures