DSpace Repository

Browsing by Author "Adhya, Amita Samanta"

Browsing by Author "Adhya, Amita Samanta"

Sort by: Order: Results:

  • Computation of minimum d-hop connected dominating set of trees in O(n) time 
    Adhya, Amita Samanta; Mondal, Sukumar; Barman, Sambhu Charan; Dayap, Jonecis A. (Journal of Algebra Combinatorics Discrete Structures and Applications, 2022)
    For a graph G = (V, E) and a fixed constant d ∈ N, a subset Dhd of the vertex set V is a d-hop connected dominating set of the graph G if each vertex t ∈ V is situated at most d-steps from at least one vertex z ∈ Dhd, that ...
  • Minimum r-neighborhood covering set of permutation graphs 
    Adhya, Amita Samanta; Mondal, Sukumar; Barman, Sambhu Charan (Discrete Mathematics, Algorithms and Applications, 2021-01)
    For a connected graph G(V,E) and a fixed integer r > 0, a node q ∈ V r-dominates another node s ∈ V if d(q, s) ≤ r. An edge (q, s) is r-neighborhood covered by a vertex t, if d(q, t) ≤ r and d(s, t) ≤ r, i.e., both the ...