INSTITUTIONAL DIGITAL REPOSITORY

Browsing by Subject "Total dominator coloring"

Browsing by Subject "Total dominator coloring"

Sort by: Order: Results:

  • 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 ...