Dominator and total dominator coloring of circulant graph Cn(1, 2)
From MaRDI portal
Publication:5059595
Cites work
- A note on dominator chromatic number of line graph and jump graph of some graphs
- Algorithmic aspects of dominator colorings in graphs
- An algorithm for the dominator chromatic number of a tree
- Chromatic number of some families of graphs
- Chromatic number, girth and maximal degree
- Coloring graph products---a survey
- Dominating sets in Cayley graphs on \(Z_n\)
- Dominator coloring of generalized Petersen graphs
- Dominator colorings and safe clique partitions
- Dominator colorings in some classes of graphs
- Dominator colorings of certain Cartesian products of paths and cycles
- Hardness results and spectral techniques for combinatorial problems on circulant graphs
- On planarity and colorability of circulant graphs
- On the dominator coloring in proper interval graphs and block graphs
- Total and connected domination numbers of Cayley graphs on \(\mathbb{Z}_n\)
- Total dominator chromatic number of a graph
- Total dominator coloring in product graphs
- Total dominator coloring of circulant graphs C_n(a,b)
- Total dominator colorings and total domination in graphs
This page was built for publication: Dominator and total dominator coloring of circulant graph Cn(1, 2)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5059595)