Skip to search formSkip to main contentSkip to account menu

Bondage number

In mathematics, the bondage number of a nonempty graph is the cardinality of the smallest set of edges E such that the domination number of the graph… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
This dissertation contends that the first religious Great Awakening of the eighteenth century provided colonial American and… 
2011
2011
A Roman dominating function on a graph G is a function f : V(G) → {0, 1, 2} satisfying the condition that every vertex u for… 
2010
2010
In this paper we consider the total bondage number bt(G) for Generalized Petersen graphs, which is defined as the minimum number… 
2009
2009
The bondage number b(G) of a nonempty graph G is the cardinality of a smallest edge set whose removal from G results in a graph… 
2009
2009
Dissertation Chair: Dr. Veronica Watson Dissertation Committee Members: Dr. Lingyan Yang and Dr. Christopher Kuipers 
2009
2009
In his novel, Dancing in the Dark (2005), Caryl Phillips fictionalises the life story of the Caribbean-born black American… 
2007
2007
As etD of a vertices in a graph G =( V, E) is said to be a total dominating set of G if every vertex in V is adjacent to some… 
1975
1975
I believe that we are undergoing a major reorganization of international life at the present time which will result in drastic…