INSTITUTIONAL DIGITAL REPOSITORY

Browsing Year-2020 by Subject "NP-complete"

Browsing Year-2020 by Subject "NP-complete"

Sort by: Order: Results:

  • 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 ...
  • Panda, B. S.; Pandey, Arti; Chaudhary, Juhi; Dane, Piyush; Kashyap, Manav (2020-09-29)
    A subset M ⊆ E of edges of a graph G = (V, E) is called a matching in G if no two edges in M share a common vertex. A matching M in G is called an induced matching if G[M], the subgraph of G induced by M, is the same as ...

Search DSpace


Advanced Search

Browse

My Account