Domination in Diameter-Two Graphs and the 2-Club Cluster Vertex Deletion Parameter
FN Abu-Khzam, L Isenmann - arxiv preprint arxiv:2408.08418, 2024 - arxiv.org
The s-club cluster vertex deletion number of a graph, or sccvd, is the minimum number of
vertices whose deletion results in a disjoint union of s-clubs, or graphs whose diameter is …
vertices whose deletion results in a disjoint union of s-clubs, or graphs whose diameter is …
(Independent) Roman Domination Parameterized by Distance to Cluster
Given a graph $ G=(V, E) $, a function $ f: V\to\{0, 1, 2\} $ is said to be a\emph {Roman
Dominating function}(RDF) if for every $ v\in V $ with $ f (v)= 0$, there exists a vertex $ u\in N …
Dominating function}(RDF) if for every $ v\in V $ with $ f (v)= 0$, there exists a vertex $ u\in N …