Some remarks on domination in cubic graphs Original Research Article

We study three recently introduced numerical invariants of graphs, namely, the signed domination number γs, the minus domination number γ− and the majority domination number γmaj. An upper bound for γs and lower bounds for γ− and γmaj are found, in terms of the order of the graph.