Dominator and total dominator coloring of circulant graph Cn(1, 2)
From MaRDI portal
Publication:5059595
DOI10.1080/09720529.2021.1885807zbMath1502.05060OpenAlexW3170917641MaRDI QIDQ5059595
Publication date: 23 December 2022
Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/09720529.2021.1885807
circulant graphdominator chromatic numberdominator coloringtotal dominator coloringtotal dominator chromatic number
Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Dominator colorings in some classes of graphs
- Hardness results and spectral techniques for combinatorial problems on circulant graphs
- Chromatic number, girth and maximal degree
- On planarity and colorability of circulant graphs
- Dominator coloring of generalized Petersen graphs
- Coloring graph products---a survey
- An algorithm for the dominator chromatic number of a tree
- Total dominator colorings and total domination in graphs
- Dominator colorings of certain Cartesian products of paths and cycles
- On the dominator coloring in proper interval graphs and block graphs
- Algorithmic Aspects of Dominator Colorings in Graphs
- Total dominator coloring of circulant graphs $C_n(a,b)$
- Chromatic number of some families of graphs
- A note on dominator chromatic number of line graph and jump graph of some graphs
- Total dominator chromatic number of a graph
This page was built for publication: Dominator and total dominator coloring of circulant graph Cn(1, 2)
