INSTITUTIONAL DIGITAL REPOSITORY

Browsing by Author "Tripathi, V."

Browsing by Author "Tripathi, V."

Sort by: Order: Results:

  • 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 ...
  • Complexity of Paired Domination in AT-free and Planar Graphs 
    Tripathi, V.; Kloks, T.; Pandey, A.; Paul, K.; Wang, H. (2022-06-28)
    For a graph G= (V, E), a subset D of vertex set V, is a dominating set of G if every vertex not in D is adjacent to atleast one vertex of D. A dominating set D of a graph G with no isolated vertices is called a paired ...
  • 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 ...