Name
Abstract | ||
|---|---|---|
A dominator coloring of a graph G is a proper coloring of G with the additional property that every vertex dominates an entire color class. The dominator chromatic number $$\\chi _d(G)$$¿d(G) of G is the minimum number of colors among all dominator colorings of G. In this paper, we determine the dominator chromatic numbers of Cartesian product graphs $$P_2 \\square P_n$$P2¿Pn and $$P_2 \\square C_n$$P2¿Cn. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1007/s00373-016-1742-7 | Graphs and Combinatorics |
Keywords | Field | DocType |
Dominator coloring, Dominator chromatic number, Cartesian product | Topology,Graph,Discrete mathematics,Combinatorics,Vertex (geometry),Chromatic scale,Cartesian product,Dominator,Mathematics | Journal |
Volume | Issue | ISSN |
33 | 1 | 1435-5914 |
Citations | PageRank | References |
0 | 0.34 | 3 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Qin Chen | 1 | 0 | 1.01 |
| Chengye Zhao | 2 | 0 | 0.34 |
| Min Zhao | 3 | 21 | 5.73 |