Total dominator chromatic number of some operations on a graph
Let <i>G</i> be a simple graph. A total dominator coloring of <i>G</i> is a proper coloring of the vertices of <i>G</i> in which each vertex of the graph is adjacent to every vertex of some color class. The total dominator chromatic number Χ<sup>t&l...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Universidad Simón Bolívar
2018-04-01
|
| Series: | Bulletin of Computational Applied Mathematics |
| Subjects: | |
| Online Access: | https://drive.google.com/open?id=1-_uDwHHXPq543uGvi8fsmj0OL5_FOpaU |