engleski

Domination numbers of cardinal products of graphs

In this work the explicit formulas for domination numbers of the cardinal products of two paths and two cycles are given. Beside this it has been examined when Vizing's conjecture holds. The domination number of P_m times P_n and C_m times C_n when n and m tend to infinity are given too. At the end of the work the k-domination is treated as a generalized term of domination numbers of cardinal products two paths and two cycles.

domination; graph; cardinal product

nije evidentirano