H. Golmohammadi

Independent domination stability in graphs

Saeid Alikhani, M. Mehraban, H. Golmohammadi, A. Zakharov

In this paper: A non-empty subset S ⊆ V of the vertex set of a simple graph G = (V, E) is called an independent dominating set if every vertex not in S is adjacent to at least one vertex in S, and no two vertices in...