Secure Distance Matrix Domination Graphs

Let DSDM (G) = (V (DSDM), E 〖 (D〗SDM) ) become an undirected, fundamental graph. Predominance in graphical representations is a specific area of theory pertaining to graphs the fact that has been thoroughly explored. A subset DSDM (S) in the event every vertex within DSDM (S) has become either contained within DSDM (S) or closest to a separate the vertices in DSDM (S), subsequently the overall quantity of points that compose the graph's structure has been identified as the dominant set. This article determines novel domination outcomes in graphs known as secure distance matrix domination. A dominating set of DSDM (S) regarding DSDM (G) can be considered to have the attributes of a stable, dominant group of DSDM (G) once it has just one available. vertex DSDM (u) ∈ (DSDM (V) \ DSDM (S) ) with respect to DSDM (uv) ∈ (DSDM (E) as well as (DSDM (S) ) \ (DSDM v ∪ DSDM u) has become a dominant set have been DSDM that includes each points DSDM (v) ∈DSDM (S). The issue is minimally secure determining a set that dominates of DSDM (G) using a minimum secure cardinality is the definition of dominance. A few secure distance matrix dominant set theorems are outlined.