This study examines the domination number in token graphs of complete graphs and stars, highlighting key structural properties.
The k-token graph of G is the graph, Fₖ(G), whose vertices are all the k-subsets of $V(G)$; with two of them adjacent whenever their symmetric difference is a pair of adjacent vertices in G. In this paper, we study the domination number of the token graphs of the star, Sₙ, and the complete graph, Kₙ.
No takes yet. Share an insight, caveat, or question.
Fabila‐Monroy et al. (2025) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: