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 k 1, k 2, k 3, k 4, k 5 there exists a cubic graph G satisfying the following conditions: ?(G) --- ir(G) ? k 1, i(G) --- ?(G) ? k 2, β0(G) --- i(G) > k 3, Γ(G) --- β0(G) --- k 4, and IR(G) --- Γ(G) --- k 5. This result settles a problem posed in [9].
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
