B. Janakiram

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
A set D of vertices in a graph G = (V, E) is a dominating set of G if every vertex in V −D is adjacent to some vertex in D. The domination number γ(G) of G is the minimum cardinality of a dominating set. We define the cobondage number b c (G) of G to be the minimum cardinality among the sets of edges X ⊆ P 2 (V) − E, where P 2 (V) = {X ⊆ V : |X| = 2} such(More)
  • 1