Given a graph G=(V, E), a vertex u∈ V ve-dominates all edges incident to any vertex in the
closed neighborhood N [u]. A subset D⊆ V is a vertex-edge dominating set if, for each edge …

An isolating set in a graph is a set X of vertices such that every edge of the graph is incident
with a vertex of X or its neighborhood. The isolation number of a graph, or equivalently the …

Given a graph G=(V, E), a vertex u∈ V ve-dominates all edges incident to any vertex of NG
[u]. A set D⊆ V is a vertex-edge dominating set if, for any edge e∈ E, there exists a vertex …

It is known that the weighted version of Edge Multiway Cut (also known as Multiterminal Cut)
is NP-complete on planar graphs of maximum degree 3. In contrast, for the unweighted …

Let G=(V, E) be a simple, undirected and connected graph. A vertex v of a simple, undirected
graph ve-dominates all edges incident to at least one vertex in its closed neighborhood N [v] …

For a simple, undirected graph $ G (V, E) $, a function $ h: V (G)\rightarrow\lbrace 0, 1,
2\rbrace $ such that each edge $(u, v) $ of $ G $ is either incident with a vertex with weight at …

Motivated by operations research applications, which involve optimizing the placement of
obnoxious facilities such as airports, industrial facilities, landfills, prisons, and other facilities …

Given an undirected graph $ G=(V, E) $, a vertex $ v\in V $ is edge-vertex (ev) dominated by
an edge $ e\in E $ if $ v $ is either incident to $ e $ or incident to an adjacent edge of $ e $. A …

A vertex v of a graph G=(V, E) is said to vertex-edge dominate every edge incident to v as
well as every edge adjacent to these incident edges. A set D⊂ V is a vertex-edge …