Total dominator chromatic number of Kneser graphs

AbstractDecomposition into special substructures inheriting significant properties is an important method for the investigation of some mathematical structures. A total dominator coloring (briefly, a TDC) of a graph G is a proper coloring (i.e. a partition of the vertex set V(G) into independent sub...

Full description

Bibliographic Details
Main Authors: Parvin Jalilolghadr, Ali Behtoei
Format: Article
Language:English
Published: Taylor & Francis Group 2023-01-01
Series:AKCE International Journal of Graphs and Combinatorics
Subjects:
Online Access:https://www.tandfonline.com/doi/10.1080/09728600.2023.2170299
_version_ 1827915572752416768
author Parvin Jalilolghadr
Ali Behtoei
author_facet Parvin Jalilolghadr
Ali Behtoei
author_sort Parvin Jalilolghadr
collection DOAJ
description AbstractDecomposition into special substructures inheriting significant properties is an important method for the investigation of some mathematical structures. A total dominator coloring (briefly, a TDC) of a graph G is a proper coloring (i.e. a partition of the vertex set V(G) into independent subsets named color classes) in which each vertex of the graph is adjacent to all of vertices of some color class. The total dominator chromatic number [Formula: see text] of G is the minimum number of color classes in a TDC of G. In this paper among some other results and by using the existence of Steiner triple systems, we determine the total dominator chromatic number of the Kneser graph [Formula: see text] for each [Formula: see text]
first_indexed 2024-03-13T03:00:44Z
format Article
id doaj.art-97e45437926d4c5c830ee2f0f31416d3
institution Directory Open Access Journal
issn 0972-8600
2543-3474
language English
last_indexed 2024-03-13T03:00:44Z
publishDate 2023-01-01
publisher Taylor & Francis Group
record_format Article
series AKCE International Journal of Graphs and Combinatorics
spelling doaj.art-97e45437926d4c5c830ee2f0f31416d32023-06-27T14:07:21ZengTaylor & Francis GroupAKCE International Journal of Graphs and Combinatorics0972-86002543-34742023-01-01201525610.1080/09728600.2023.2170299Total dominator chromatic number of Kneser graphsParvin Jalilolghadr0Ali Behtoei1Department of Mathematics, University of Mohaghegh Ardabili, Ardabil, IranDepartment of Pure Mathematics, Faculty of Science, Imam Khomeini International University, Qazvin, IranAbstractDecomposition into special substructures inheriting significant properties is an important method for the investigation of some mathematical structures. A total dominator coloring (briefly, a TDC) of a graph G is a proper coloring (i.e. a partition of the vertex set V(G) into independent subsets named color classes) in which each vertex of the graph is adjacent to all of vertices of some color class. The total dominator chromatic number [Formula: see text] of G is the minimum number of color classes in a TDC of G. In this paper among some other results and by using the existence of Steiner triple systems, we determine the total dominator chromatic number of the Kneser graph [Formula: see text] for each [Formula: see text]https://www.tandfonline.com/doi/10.1080/09728600.2023.2170299Kneser graphtotal dominator coloringSteiner triple systemtotal domination05C1505C69
spellingShingle Parvin Jalilolghadr
Ali Behtoei
Total dominator chromatic number of Kneser graphs
AKCE International Journal of Graphs and Combinatorics
Kneser graph
total dominator coloring
Steiner triple system
total domination
05C15
05C69
title Total dominator chromatic number of Kneser graphs
title_full Total dominator chromatic number of Kneser graphs
title_fullStr Total dominator chromatic number of Kneser graphs
title_full_unstemmed Total dominator chromatic number of Kneser graphs
title_short Total dominator chromatic number of Kneser graphs
title_sort total dominator chromatic number of kneser graphs
topic Kneser graph
total dominator coloring
Steiner triple system
total domination
05C15
05C69
url https://www.tandfonline.com/doi/10.1080/09728600.2023.2170299
work_keys_str_mv AT parvinjalilolghadr totaldominatorchromaticnumberofknesergraphs
AT alibehtoei totaldominatorchromaticnumberofknesergraphs