The Domination and Secure Domination Numbers of Direct Product of Cliques with Paths and Cycles

Abstract

In this paper, we obtain the exact values of several domination parameters for the direct product of a complete graph with a path or a cycle. Specifically, we determine the domination number, independent domination number, [1,2]-domination number, secure domination number, and 2-domination number for this family of graphs. We show that, in these graphs, the independent domination number and the [1,2]-domination number coincide with the domination number, while the secure domination number coincides with the 2-domination number. Additionally, as a consequence of our findings, we provide counterexamples to disprove some erroneous results in the literature.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…