[PDF][PDF] On agglomeration-based rupture degree in networks and a heuristic algorithm
M Ağtaş, T Turaci - Acta Universitatis Sapientiae, Informatica, 2023 - intapi.sciendo.com
The rupture degree is one the most important vulnerability parameter in networks which are
modelled by graphs. Let G (V (G), E (G)) be a simple undirected graph. The rupture degree …
modelled by graphs. Let G (V (G), E (G)) be a simple undirected graph. The rupture degree …
Disjunctive total domination in some tree networks
Networking has been an essential field of multidisciplinary study, including computational
theory, mathematics, social sciences, computer science, and other theoretical and applied …
theory, mathematics, social sciences, computer science, and other theoretical and applied …
A heuristic algorithm to find rupture degree in graphs
Since the problem of Konigsberg bridge was released in 1735, there have been many
applications of graph theory in mathematics, physics, biology, computer science, and …
applications of graph theory in mathematics, physics, biology, computer science, and …
Strong global distribution center of graphs
M Edalat, H Maimani - Communications in Combinatorics …, 2025 - comb-opt.azaruniv.ac.ir
Let $ G=(V, E) $ be a graph. A strong global distribution center of $ G $ is a dominating set $
S\subseteq V $ such that for any $ v\in V\setminus S $, there exists a vertex $ u\in N [v]\cap S …
S\subseteq V $ such that for any $ v\in V\setminus S $, there exists a vertex $ u\in N [v]\cap S …