3 papers
cs.DM2026
Analyzing Network Robustness via Residual Closeness
Hande Tuncel Golpek, Mehmet Ali Bilici, Aysun Aytac
Networks are inherently vulnerable to vertex failures, making the analysis of their structural robustness a fundamental problem in graph theory. In this study, we investigate the c…
cs.DM2025
Paired Disjunctive Domination Number of Middle Graphs
Hande Tuncel Golpek, Zeliha Kartal Yildiz, Aysun Aytac
The concept of domination in graphs plays a central role in understanding structural properties and applications in network theory. In this study, we focus on the paired disjunctiv…
cs.DM2024
Closeness and Residual Closeness of Harary Graphs
Hande Tuncel Golpek, Aysun Aytac
Analysis of a network in terms of vulnerability is one of the most significant problems. Graph theory serves as a valuable tool for solving complex network problems, and there exis…