Let M be a right module over a ring R. In this manuscript, we shall study on a special case of F-inverse split modules where F is a fully invariant submodule of M introduced in [12]. We say M is Z 2(M)-inverse split provided f^(-1)(Z2(M)) is a direct summand of M for each endomorphism f of M. We prove that M is Z2(M)-inverse split if and only if M is a direct...

The edge tenacity Te(G) of a graph G is dened as:Te(G) = min {[|X|+τ(G-X)]/[ω(G-X)-1]|X ⊆ E(G) and ω(G-X) > 1} where the minimum is taken over every edge-cutset X that separates G into ω(G - X) components, and by τ(G - X) we denote the order of a largest component of G. The objective of this paper is to determine this quantity for split graphs. Let G = (Z; I; E) be a noncomplete connected split...

the edge tenacity te(g) of a graph g is dened as:te(g) = min {[|x|+τ(g-x)]/[ω(g-x)-1]|x ⊆ e(g) and ω(g-x) > 1} where the minimum is taken over every edge-cutset x that separates g into ω(g - x) components, and by τ(g - x) we denote the order of a largest component of g. the objective of this paper is to determine this quantity for split graphs. let g = (z; i; e) be a noncomplete connected spli...

Split cuts are among the most important and well-understood cuts for general mixed-integer programs. In this paper we consider some recent generalizations of split cuts and compare their relative strength. More precisely, we compare the elementary closures of split, cross, crooked cross and general multi-branch split cuts as well as cuts obtained from multi-row and basic relaxations. We present...

A subset D of the vertex set V(G) a graph G is said to be dominating if every not in adjacent at least one V-D. an interior v ∈D, G. The minimum cardinalities interiordominating sets called interiordomination number γId (G) G.An splitinteriordominating induced subgraph disconnected An strong split totally with two vertices. In this paper, we determine and γsId γssid for some standard grap...

Gaussian split Ewald (GSE) is a versatile Ewald mesh method that is fast and accurate when used with both real-space and k-space Poisson solvers. While real-space methods are known to be asymptotically superior to k-space methods in terms of both computational cost and parallelization efficiency, k-space methods such as smooth particle-mesh Ewald (SPME) have thus far remained dominant because t...

the noncommuting graph $nabla (g)$ of a group $g$ is asimple graph whose vertex set is the set of noncentral elements of$g$ and the edges of which are the ones connecting twononcommuting elements. we determine here, up to isomorphism, thestructure of any finite nonabeilan group $g$ whose noncommutinggraph is a split graph, that is, a graph whose vertex set can bepartitioned into two sets such t...