SECURITY NUMBER PADA CORONA PRODUK DARI GRAF
Main Article Content
Abstract
Given G is a graph with a vertex set (V(G) and an edge set (E(G)).
The non-empty set S⊆V is considered safe if any attack on S can be maintained.
The set is safe on G=(V,E) and A ={A_1,A_2,…,A_k} becomes an attack on S and D = {D_1,D_2,.., D_k} becomes a defense against an attack on S.
The security number of graph G is symbolized by s(G), is The smallest cardinality of the S⊆V safe set.
This journal will discuss the product corona security number.
The security number results from the product corona are s(G⨀C_n)=3 and s(G⨀P_n)=2 with C_n and P_n respectively cycle and trajectory over n vertex.
The non-empty set S⊆V is considered safe if any attack on S can be maintained.
The set is safe on G=(V,E) and A ={A_1,A_2,…,A_k} becomes an attack on S and D = {D_1,D_2,.., D_k} becomes a defense against an attack on S.
The security number of graph G is symbolized by s(G), is The smallest cardinality of the S⊆V safe set.
This journal will discuss the product corona security number.
The security number results from the product corona are s(G⨀C_n)=3 and s(G⨀P_n)=2 with C_n and P_n respectively cycle and trajectory over n vertex.
Article Details
Section
Applied Mathematics
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.