Alcoholics Anonymous (AA) offers a live stage to study how humility is worn by thousands for another day of sobriety and more freedom from the bondage of self. It has been the coauthors' intent to emphasize the significance of humility as a cardinal virtue across the 12-Step program and as essential to all its key elements. The coauthors have placed this emphasis in the context of a wider theol...

Let, of the domination number of graph. The bondage number G was first introduced by Fink, Jacobson, the minimum among all sets of holds. In this paper we show that for graph G satisfying

Abstract. In this paper we give tight upper bounds on the total domination number, the weakly connected domination number and the connected domination number of a graph in terms of order and Euler characteristic. We also present upper bounds for the restrained bondage number, the total restrained bondage number and the restricted edge connectivity of graphs in terms of the orientable/nonorienta...

The bondage number b(G) of a non empty graph G is the minimum number of edger whose removal from G results in a graph having domination number greater than the domination number of G. In this paper we characterize graphs for which b(G) = p − 1 and b(G) = (γ − 1)+̇1. We also introduce the concept of uniform bondage number bu(G) and determine the exact value of bu(G) for several classes of graphs....

The bondage number b(G) of a graph G is the smallest number of edges whose removal results in a graph with domination number greater than the domination number of G. Kang and Yuan [Bondage number of planar graphs. Discrete Math. 222 (2000), 191198] proved b(G) 6 min{8,∆+ 2} for every connected planar graph G, where ∆ is the maximum degree of G. Later Carlson and Develin [On the bondage number o...

A Roman dominating function on a graph G = (V,E) is a function f : V → {0, 1, 2} such that every vertex v ∈ V with f(v) = 0 has at least one neighbor u ∈ V with f(u) = 2. The weight of a Roman dominating function is the value f(V (G)) = ∑ u∈V (G) f(u). The minimum weight of a Roman dominating function on a graph G is called the Roman domination number, denoted by γR(G). The Roman bondage number...

A set D 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 vertex in D. The total domination number γt(G) is the minimum cardinality of a total dominating set. If γt(G) = |V (G)| , the minimum cardinality of a set E0 ⊆ E(G), such that G−E0 contains no isolated vertices and γt(G− E0) > γt(G), is called the total bondage number of...

The Letter to the Galatians is a polemical correspondence about course of gospel mission that at stake in view apostle Paul. When Paul represents his own contacts with Jerusalem church, he defends “our freedom which we have Christ Jesus” (Gal 2:4). In aim focus on unity all Christ, even goes lengths state there no difference between slave and free 3:28), while polemically associating both forme...