This document contains instructions for finding the domination number (γ(G)), total domination number (γt(G)), and secure total domination number (γst(G)) of two graphs. For the first graph, γ(G) = 3, γt(G) = 4, and γst(G) = 4. For the second graph, γ(G) = 3, γt(G) = 4, and γst(G) = 6. The document provides these values to find graph theoretic parameters for two example graphs.
This document contains instructions for finding the domination number (γ(G)), total domination number (γt(G)), and secure total domination number (γst(G)) of two graphs. For the first graph, γ(G) = 3, γt(G) = 4, and γst(G) = 4. For the second graph, γ(G) = 3, γt(G) = 4, and γst(G) = 6. The document provides these values to find graph theoretic parameters for two example graphs.
This document contains instructions for finding the domination number (γ(G)), total domination number (γt(G)), and secure total domination number (γst(G)) of two graphs. For the first graph, γ(G) = 3, γt(G) = 4, and γst(G) = 4. For the second graph, γ(G) = 3, γt(G) = 4, and γst(G) = 6. The document provides these values to find graph theoretic parameters for two example graphs.