INSTITUTIONAL DIGITAL REPOSITORY

Browsing by Author "Henning, M. A."

Browsing by Author "Henning, M. A."

Sort by: Order: Results:

  • Algorithmic aspects of semitotal domination in graphs 
    Henning, M. A.; Pandey, A. (2021-08-21)
    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 ...
  • Complexity and algorithms for semipaired domination in graphs 
    Henning, M. A.; Pandey, A.; Tripathi, V. (2021-07-03)
    For a graph G = (V, E) with no isolated vertices, a set D ⊆ V is called a semipaired dominating set of G if (i) D is a dominating set of G, and (ii) D can be partitioned into two element subsets such that the vertices ...
  • Semipaired domination in some subclasses of chordal graphs 
    Henning, M. A.; Pandey, A.; Tripathi, V. (2021-12-06)
    A dominating set D of a graph G without isolated vertices is called semipaired dominating set if D can be partitioned into 2-element subsets such that the vertices in each set are at distance at most 2. The semipaired ...