Abstract
We consider the {k}-domination number γ{k}(G) of a graph G and the Cartesian product G□H and the strong direct product G⊠H of graphs G and H. We prove that for integers k,m≥1, γ{k}(G⊠H)≥γ{γ{k}(H)}(G) and γ{km}(G⊠H)≤γ{k}(G)γ{m}(H), from which earlier results obtained by Fisher on γ(G⊠H) and Fisher et al. on the fractional domination number γf(G⊠H) were derived. We extend a result from Brešar et al. on γ(G□H) for claw-free graphs G. We also point out some sufficient conditions for graphs to satisfy the generalized form of Vizing’s conjecture suggested by Hou and Lu.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.