Sciweavers

DM
2007
142views more  DM 2007»
13 years 11 months ago
Dominating direct products of graphs
An upper bound for the domination number of the direct product of graphs is proved. It in particular implies that for any graphs G and H, γ(G × H) ≤ 3γ(G)γ(H). Graphs with a...
Bostjan Bresar, Sandi Klavzar, Douglas F. Rall