2000 character limit reached
Total dominator chromatic number of Kneser graphs
Published 1 Jan 2020 in math.CO | (2001.00221v1)
Abstract: In this paper among some other results and by using the existance of Steiner triple systems, we determine the total dominator chromatic number of the Kneser graph KG(n,2).
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.