INSTITUTIONAL DIGITAL REPOSITORY

Browsing by Subject "NP-completeness"

Browsing by Subject "NP-completeness"

Sort by: Order: Results:

  • Algorithmic aspects of paired disjunctive domination in graphs 
    Henning, M.A; Pandey, A.; Tripathi, V. (2024-07-07)
    In a graph G = (V , E) without an isolated vertex, a dominating set D ⊆ V is a paired dominating set if the graph G[D] induced by D has a perfect matching. Further, a set D ⊆ V is a disjunctive dominating set of G if for ...
  • Algorithms for maximum internal spanning tree problem for some graph classes 
    Sharma, G.; Pandey, A.; Wiga, M.C. (2022-10-21)
    For a given graph G, a maximum internal spanning tree of G is a spanning tree of G with maximum number of internal vertices. The Maximum Internal Spanning Tree (MIST) problem is to find a maximum internal spanning tree ...
  • 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 ...
  • Domination in some subclasses of bipartite graphs 
    Pandey, A.; Panda, B. S. (2021-08-27)
    A set D ⊆ V is called a dominating set of G = (V, E) if |NG[v] ∩ D| ≥ 1 for all v ∈ V. The Minimum Domination problem is to find a dominating set of minimum cardinality of the input graph. In this paper, we study the ...
  • Restrained domination in some subclasses of chordal graphs 
    Pandey, A.; Panda, B.S. (2017-12-21)
    A set D ⊆ V of a graph G = (V,E) is called a restrained dominating set of G if every vertex not in D is adjacent to a vertex in D and to a vertex in V \ D. The MINIMUM RESTRAINED DOMINATION problem is to find a restrained ...
  • 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 ...
  • Semitotal domination on AT-Free graphs and circle graphs 
    Kloks, T.; Pandey, A. (2021-12-03)
    For a graph G = (V,E) with no isolated vertices, a set D ⊆ V is called a semitotal dominating set of G if (i) D is a dominating set of G, and (ii) every vertex in D has another vertex in D at a distance at most two. The ...