INSTITUTIONAL DIGITAL REPOSITORY

Browsing Research Publications by Subject "Graph algorithm"

Browsing Research Publications by Subject "Graph algorithm"

Sort by: Order: Results:

  • Algorithmic aspects of b-disjunctive domination in graphs 
    Panda, B.S.; Pandey, A.; Paul, S. (2018-07-25)
    For a fixed integer b>1 b>1 , a set D⊆V D⊆V is called a b-disjunctive dominating set of the graph G=(V,E) G=(V,E) if for every vertex v∈V∖D v∈V∖D , v is either adjacent to a vertex of D or has at least b ...
  • 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 ...
  • Algorithmic aspects of semitotal domination in graphs 
    Henning, M. A.; Pandey, A. (2021-08-21)
    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 ...
  • 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 ...
  • Maximum weight induced matching in some subclasses of bipartite graphs 
    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 ...
  • On the complexity of minimum cardinality maximal uniquely restricted matching in graphs 
    Panda, B.S.; Pandey, A. (2022-09-20)
    For a graph G =(V,E), a set M ⊆ 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 uniquely restricted matching in G if there is no other matching of the same cardinality ...

Search DSpace


Advanced Search

Browse

My Account