Hide/Show Apps

Minimum weighted perfect neighborhood set problem

Download
2020
Hastürk, Umur
Given an undirected simple graph G = (V,E), the open neighborhood of a vertex j ∈ V , denoted by δ(j), is defined as the set of all vertices that are adjacent to j , i.e., δ(j) = {i