We consider the problem of incrementally computing a minimal dominating set of a directed graph after the insertion or deletion of a set of arcs. Earlier results have either focused on the study of the properties that minimum (not minimal) dominating sets preserved or lacked to investigate which update affects a minimal dominating set and in what ways. In this paper, we first show how to increm...

In this paper, we study both concepts of geodetic dominatingand edge geodetic dominating sets and derive some tight upper bounds onthe edge geodetic and the edge geodetic domination numbers. We also obtainattainable upper bounds on the maximum number of elements in a partitionof a vertex set of a connected graph into geodetic sets, edge geodetic sets,geodetic domin...

This paper investigates a mechanism for reliable generation of sparse code in a sparsely connected, hierarchical, learning memory. Activity reduction is accomplished with local competitions that suppress activities of unselected neurons so that costly global competition is avoided. The learning ability and the memory characteristics of the proposed winner-take-all network and an oligarchy-take-...

In this paper we generalize some classical factorizations of a fuzzy relation into a symmetric component (indifference) and an asymmetric and regular component (regular fuzzy strict preference). From the above notions, we establish two properties of any regular fuzzy strict preference of a max-∗-transitive fuzzy relation, which are then used to obtain new fuzzy versions of Gibbard’s oligarchy t...

the council of areopagus as a judicial establishment monitored the proper implementation of rule of law in the polis (city-state) of athens. while, the main responsibility and duty of areopagus was to adjudicate the cases of the most serious crimes, it intervened in the political affairs as well. eventually, after long-lasting political conflicts between athenian oligarchy and democracy, this e...

The k-dominating graph Dk(G) of a graph G is defined on the vertex set consisting of dominating sets of G with cardinality at most k, two such sets being adjacent if they differ by either adding or deleting a single vertex. In this paper, after presenting several basic properties of k-dominating graphs, it is proved that if G is a graph with no isolates, of order n ≥ 2, and with G ∼= Dk(G), the...

In the present study, purpose was to examine Adnan Menderes from perspective of Elite Theory. For this purpose, Historical Research, Content Analysis, and Leader Analysis Methods were employed in study. After information provided about elite Theory life examined terms At end it concluded that Menderes, who a socio-economic political elite, banned power “by force” line with Pareto’s “Elite Rotat...

a function $f:v(g)rightarrow {-1,0,1}$ is a {em minusdominating function} if for every vertex $vin v(g)$, $sum_{uinn[v]}f(u)ge 1$. a minus dominating function $f$ of $g$ is calleda {em global minus dominating function} if $f$ is also a minusdominating function of the complement $overline{g}$ of $g$. the{em global minus domination number} $gamma_{g}^-(g)$ of $g$ isdefined as $gamma_{g}^-(g)=min{...