On the Neighbor Weak Integrity of Graphs
Romanian Journal of Mathematics and Computer Science · 2026-06-14
DOI: 10.66899/34e38fce ↗At a glance
Journal article in Romanian Journal of Mathematics and Computer Science, published online on 2026-06-14. Written by Murat Taşkesen and 1 co-authors.
Abstract (original language)
In this paper, neighbor weak integrity is introduced as a graph vulnerability parameter based on vertex subset removal, where the selected subset is referred to as a subversion strategy. The parameter measures structural vulnerability by minimizing the sum of the subset size and the number of edges in the largest connected component of the resulting graph after its removal. Exact values are obtained for complete graphs, star graphs, path graphs, cycle graphs, and two specific families of tree graphs. The split graph operation is also investigated, with explicit results derived for paths, cycles, and wheel graphs.
Cite
APA
Taşkesen, M., & Kirlangiç, A. (2026). On the Neighbor Weak Integrity of Graphs. Romanian Journal of Mathematics and Computer Science. https://doi.org/10.66899/34e38fce
Vancouver
Taşkesen M, Kirlangiç A. On the Neighbor Weak Integrity of Graphs. Romanian Journal of Mathematics and Computer Science. 2026. doi:10.66899/34e38fce
BibTeX
@article{Takesen2026,
author = {Taşkesen, Murat and Kirlangiç, Alpay},
title = {On the Neighbor Weak Integrity of Graphs},
journal = {Romanian Journal of Mathematics and Computer Science},
year = {2026},
doi = {10.66899/34e38fce}
}
EUVIMED