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...

Abstract In order to study the effect of super absorbent on runoff volume in slopes and various intensity of rainfall research was accomplish according to split – factorial blocks method with main treatment and two accessory treatments in three replicate . the main treatment consist of three dominant slopes (10 , 20 , 30 percent ) and accessory treatments consist of five levels of substance su...

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...