The closed neighborhood NG[e] of an edge e in a graph G is the set consisting of e and of all edges having a common end-vertex with e. Let f be a function on E(G), the edge set of G, into the set {−1, 1}. If ∑ x∈N [e] f(x) ≥ 1 for at least k edges e of G, then f is called a signed edge k-subdominating function of G. The minimum of the values ∑ e∈E(G) f(e), taken over all signed edge k-subdomina...

The closed neighborhood NG[e] of an edge e in a graph G is the set consisting of e and of all edges having a common end-vertex with e. Let f be a function on E(G), the edge set of G, into the set {−1, 0, 1}. If ∑ x∈N [e] f(x) ≥ 1 for at least k edges e of G, then f is called a minus edge k-subdominating function of G. The minimum of the values ∑ e∈E(G) f(e), taken over all minus edge k-subdomin...

the concept of  -semihypergroups is a generalization of semigroups, a generalization of semihypergroups and a generalization of  -semigroups. in this paper, we study the concept of semiprime ideals in a  -semihypergroup and prove some results. also, we introduce the notion of  -hypergroups and closed  -subhypergroups. finally, we study the concept of  -semihypergroups associated to binary...

A subset S of the vertices of a directed acyclic graph is called glb-closed, if it contains the greatest lower bounds of all pairs of vertices of S. The glb-closure of S is the smallest glb-closed subset containing S. An eecient output sensitive algorithm for computing glb-closures is presented and two applications in the eld of object-oriented programming languages are discussed. 1 The problem...

In this paper, we discuss generating theorems of polyhedral quadrangulations closed surfaces. We prove that the set eight reductional operations {R1, …, R8} defined for is finitizable any surface F2, is, there exist finitely many minimal F2 using such R1, R7 and R8. Furthermore, show proper subset not torus.

Real-world applications now deal with a massive amount of data, and information about the world is inaccurate, incomplete, or uncertain. Therefore, we present in our paper proposed model for solving problems. This based on class locally generalized closed sets, namely, simply* alpha closed* sets closed** (briefly, -sets -sets), open set. We also introduce various concepts their properties relat...