Browsing Year-2018 by Author "Pandey, A."

Now showing items 1-2 of 2

Algorithmic aspects of b-disjunctive domination in graphs

Panda, B.S.; Pandey, A.; Paul, S. (2018-07-25)

For a fixed integer b>1 b>1 , a set D⊆V D⊆V is called a b-disjunctive dominating set of the graph G=(V,E) G=(V,E) if for every vertex v∈V∖D v∈V∖D , v is either adjacent to a vertex of D or has at least b ...
Algorithmic aspects of semitotal domination in graphs

Henning, M.A.; Pandey, A. (2019-01-02)

For a graph G = (V, E), a set D ⊆ V is called a semitotal dominating set of G if D is a dominating set of G, and every vertex in D is within distance 2 of another vertex of D. The Minimum Semitotal Domination problem is ...

Now showing items 1-2 of 2

Search DSpace