Double domination number of the shadow (2, 3)-distance graphs
A Aytaç, A Mutlu - Malaya Journal of Matematik, 2023 - malayajournal.org
Abstract Let G (V, E) be a graph with the vertex set V (G) and S be a subset of V (G). If every
vertex of V is dominated by S at least twice, then the set S is called a double domination set …
vertex of V is dominated by S at least twice, then the set S is called a double domination set …
A Vulnerability Parameter of Networks
The vulnerability in a communication network is the measurement of the strength of the
network against damage that occurs in nodes or communication links. It is important that a …
network against damage that occurs in nodes or communication links. It is important that a …