Total dominator coloring of circulant graphs C_n(a,b)

zbMATH Open1468.05078arXiv1905.00211MaRDI QIDQ4989591FDOQ4989591

Authors: Parvin Jalilolghadr, A. P. Kazemi, Abdollah Khodkar 

Publication date: 25 May 2021

Abstract: The circulant graph $C_n(S)$ with connection set $Ssubseteq1,2,cdots,n$ is the graph with vertex set $V=1,ldots,n$ and two vertices $x,y$ are adjacent if $|x-y|inS$. In this paper, we will calculate the total dominator chromatic number of the circulant graph $C_n(a,b)$ when $ngeq6$, $gcd(a,n)=1$ and $a^{-1}bequiv3pmodn$.

Full work available at URL: https://arxiv.org/abs/1905.00211

Recommendations

• Total dominator colorings in cycles
• Total dominator coloring of central graphs.
• Total and fractional total colourings of circulant graphs
• Total dominator coloring in product graphs
• Total dominator coloring number of middle graphs

zbMATH Keywords

total domination numbercirculant graphtotal dominator chromatic number

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Coloring of graphs and hypergraphs (05C15)

Cited In (4)

• Complexity of total dominator coloring in graphs
• Dominator and total dominator colorings in graphs
• Dominator and total dominator coloring of circulant graph C_n(1, 2)
• On the reflexive edge strength of the circulant graphs

This page was built for publication: Total dominator coloring of circulant graphs \(C_n(a,b)\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4989591)