Given a simple undirected graph G and a positive integer k, the k-forcing number of G, denoted Fk(G), is the minimum number of vertices that need to be initially colored so that all vertices eventually become colored during the discrete dynamical process described by the following rule. Starting from an initial set of colored vertices and stopping when all vertices are colored: if a colored ver...

In this paper, we prove some refined estimate in the neck region when a sequence of harmonic maps from surfaces blow up. The new puts more restrictions to bubble and weak limit map than touching required by classical no-neck theorem. As an application, inequality about nullity index blow-up occurs.

The nullity of a graph G is the multiplicity zero as an eigenvalue its adjacency matrix. An assignment weights to vertices graph, that satisfies sum condition over neighbors each vertex, and uses maximum number independent variables denoted by high weighting graph. This applicable tool used determine Two types graphs are defined, change their nullities studied, namely, G+ab constructed from add...

<p>For many years there has been a dispute in the field of commercial law concerning nature ruling issued as part an action for annulment resolution general meeting under Article 425 Code Commercial Companies (hereinafter: CCC). The multitude both studies representatives doctrine and opinions expressed court decisions, allows this to be included two opposing theses, which, together with a...