DSpace Repository

Browsing by Author "S. K., Vaidya"

Browsing by Author "S. K., Vaidya"

Sort by: Order: Results:

  • S. K., Vaidya; Ajani, P. D. (Malaya Journal of Matematik, 219)
    For a graph G = (V, E), a set S ⊆ V is a restrained dominating set if every vertex not in S is adjacent to a vertex in S and also to a vertex in V − S. The minimum cardinality of a restrained dominating set of G is called ...
  • S. K., Vaidya; Ajani, P. D. (JOURNAL OF SCIENTIFIC RESEARCH, 2021)
    For a graph, a set is a restrained dominating (restrained edge dominating) set if every vertex (edge) not in S is adjacent (incident) to a vertex (edge) in S and to a vertex (edge) in The minimum cardinality of a restrained ...