Wyniki wyszukiwania dla: DOUBLE BONDAGE

• On the double bondage in graphs

  Publikacja

  • M. Krzywkowski

  - UTILITAS MATHEMATICA - Rok 2012

  A vertex of a graph is said to dominate itself and all of its neighbors. A double dominating set of a graph G=(V,E) is a set D of vertices of G such that every vertex of G is dominated by at least two vertices of D. The double domination number of a graph G, denoted by gamma_d(G), is the minimum cardinality of a double dominating set of G. The double bondage number of G, denoted by b_d(G), is the minimum cardinality among all sets...