Abstract
Let ir(G), γ(G), i(G), β0(G), Γ(G) and IR(G) be the irredundance number, the domination number, the independent domination number, the independence number, the upper domination number and the upper irredundance number of a graph G, respectively. In this paper we show that for any nonnegative integers k1, k2, k3, k4, k5 there exists a cubic graph G satisfying the following conditions: γ(G) – ir(G) ≥ k1, i(G) – γ(G) ≥ k2, β0(G) – i(G) > k3, Γ(G) – β0(G) – k4, and IR(G) – Γ(G) – k5. This result settles a problem posed in [9].
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding author
Additional information
Supported by the INTAS and the Belarus Government (Project INTAS-BELARUS 97-0093).
Supported by RUTCOR.
Rights and permissions
About this article
Cite this article
Zverovich, I.E., Zverovich, V.E. The Domination Parameters of Cubic Graphs. Graphs and Combinatorics 21, 277–288 (2005). https://doi.org/10.1007/s00373-005-0608-1
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/s00373-005-0608-1