Eternal and m-eternal domination are concerned with using mobile guards to protect a graph against infinite sequences of attacks at vertices. Eternal domination allows one guard to move per attack, whereas more than one guard may move per attack in the m-eternal domination model. Inequality chains consisting of the domination, eternal domination, m-eternal domination, independence, and clique c...

A subset S of vertices in a graph G is a global total dominating set, or just GTDS, if S is a total dominating set of both G and G. The global total domination number γgt(G) of G is the minimum cardinality of a GTDS of G. In this paper, we show that the decision problem for γgt(G) is NP-complete, and then characterize graphs G of order n with γgt(G) = n− 1.

Abstract: This paper investigates the problem of global finite-time stabilization by output feedback for a class of high-order time-varying nonlinear systems with uncertainties. By introducing sign function and necessarily modifying the homogeneous domination approach, a continuous output feedback controller is successfully constructed to guarantee the global uniform finite-time stability of th...

BackgroundGame Theory Interpretation MethodsRandomizationFunctional Lagrange Multipliers ConclusionsReferences

This paper uses a novel account of non-ideal political action that can justify radical responses to severe climate injustice, including and especially deliberate attempts engineer the system in order reflect sunlight into space cooling planet. In particular, it discusses question what those suffering from injustice may do secure their fundamental rights interests face change impacts. Using exam...

Topological centrality is a significant measure for characterising the relative importance of a node in a complex network. For directed networks that model dynamic processes, however, it is of more practical importance to quantify a vertex's ability to dominate (control or observe) the state of other vertices. In this paper, based on the determination of controllable and observable subspaces un...

In this paper, we introduce the closed domination in graphs. Some interesting relationships are known between domination and closed domination and between closed domination and the independent domination. It is also shown that any triple m, k and n of positive integers with 3 ≤ m ≤ k ≤ n are realizable as the domination number, closed domination number and independent domination number, respect...