We studied the renal function and the intrarenal blood flow of nine dogs whose thoracic inferior vena cava had been previously ligated (caval dogs) and nine other dogs. Following preparative surgery which included placement of a left atrial catheter, a femoral artery catheter, and bilateral ureteral catheters, the caval dogs gained an average of 2.1 kg of fluid weight, whereas the normal dogs g...

1 BACKGROUND Surgical correction of elongated labia minora (LM) is one of the most sought reconstructive procedures after plastic surgery.1,2 The illusion of simplicity of such operations and failure to observe important technical aspects often lead to total resection of the labia, causing suffering of patients and problems for operating doctor. In such cases, reconstructive surgery is the only...

Limited dominating broadcasts were proposed as a variant of dominating broadcasts, where the broadcast function is upper bounded. As a natural extension of domination, we consider dominating 2-broadcasts along with the associated parameter, the dominating 2-broadcast number. We prove that computing the dominating 2-broadcast number is a NP-complete problem, but can be achieved in linear time fo...

Given a graph G together with a capacity function c : V (G) → N, we call S ⊆ V (G) a capacitated dominating set if there exists a mapping f : (V (G) \ S) → S which maps every vertex in (V (G) \S) to one of its neighbors such that the total number of vertices mapped by f to any vertex v ∈ S does not exceed c(v). In the Planar Capacitated Dominating Set problem we are given a planar graph G, a ca...

we define minimal cn-dominating graph $mathbf {mcn}(g)$, commonality minimal cn-dominating graph $mathbf {cmcn}(g)$ and vertex minimal cn-dominating graph $mathbf {m_{v}cn}(g)$, characterizations are given for graph $g$ for which the newly defined graphs are connected. further serval new results are developed relating to these graphs.

In a graph G, a vertex is said to dominate itself and its neighbors. The Domination game is a two player game played on a finite graph. Players alternate turns in choosing a vertex that dominates at least one new vertex. The game ends when no move is possible, that is when the set of chosen vertices forms a dominating set of the graph. One player (Dominator) aims to minimize the size of this se...