Total dominator chromatic number of Kneser graphs
Parvin Jalilolghadr, Ali Behtoei
TL;DR
This paper determines the total dominator chromatic number of Kneser graphs KG(n,2) using Steiner triple systems, providing new insights into graph coloring properties of these combinatorial structures.
Contribution
It introduces a novel approach to calculating the total dominator chromatic number of KG(n,2) leveraging Steiner triple systems, which was not previously explored.
Findings
Exact total dominator chromatic number for KG(n,2) determined
Utilizes Steiner triple systems to establish coloring bounds
Advances understanding of coloring properties in Kneser graphs
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).
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph Labeling and Dimension Problems · Advanced Graph Theory Research · graph theory and CDMA systems