Domination Coloring of Graphs
A domination coloring of a graph <i>G</i> is a proper vertex coloring of <i>G</i>, such that each vertex of <i>G</i> dominates at least one color class (possibly its own class), and each color class is dominated by at least one vertex. The minimum number of colors among all domination colorings is c...
Furkejuvvon:
| Váldodahkkit: | , , , |
|---|---|
| Materiálatiipa: | Artigo |
| Giella: | Inglês |
| Almmustuhtton: |
MDPI AG
2022-03-01
|
| Ráidu: | Mathematics |
| Fáttát: | |
| Liŋkkat: | https://www.mdpi.com/2227-7390/10/6/998 |
| Fáddágilkorat: |
Eai fáddágilkorat, Lasit vuosttaš fáddágilkora!
|