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. (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 ...
  • Complexity of Total Dominator Coloring in Graphs 
    Henning, M.A.; ., K.; Paul, K. (2024-05-06)
    Let G = (V,E) be a graph with no isolated vertices. A vertex v totally dominates a vertexw(w= v),ifvisadjacenttow.AsetD ⊆ V calledatotaldominatingsetofG if everyvertexv ∈ V istotallydominatedbysomevertexin D.Theminim ...