Domination number of Token Graphs
Abstract
The k-token graph of G is the graph, Fk(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, Sn, and the complete graph, Kn.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.