Abstract. A topological group H is called ω -narrow if for every neighbourhood V of it’s identity element there exists a countable set A such that V A = H = AV. A semigroup G is called a generalized group if for any x ∈ G there exists a unique element e(x) ∈ G such that xe(x) = e(x)x = x and for every x ∈ G there exists x − 1 ∈ G such that x − 1x = xx − 1 = e(x). Also le...

As a generalization of countably C-approximating posets, the concept of countably QC-approximating posets is introduced. With the countably QC-approximating property, some characterizations of generalized completely distributive lattices and generalized countably approximating posets are given. The main results are as follows: (1) a complete lattice is generalized completely distributive if and...

In 2008, Al-Thaga and Shahzad [Generalized I-nonexpansive self-maps and invariant approximations, Acta Math. Sinica 24(5) (2008), 867{876]introduced the notion of occasionally weakly compatible mappings (shortly owcmaps) which is more general than all the commutativity concepts. In the presentpaper, we prove common xed point theorems for families of owc maps in Mengerspaces. As applications to ...

In this paper, we deal with Molaei’s generalized groups. We definethe notion of a fuzzy generalized subgroup with respect to a t-norm (orT-fuzzy generalized subgroup) and give some related properties. Especially,we state and prove the Representation Theorem for these fuzzy generalizedsubgroups. Next, using the concept of continuity of t-norms we obtain a correspondencebetween TF(G), the set of ...

in this paper, we deal with molaei’s generalized groups. we definethe notion of a fuzzy generalized subgroup with respect to a t-norm (ort-fuzzy generalized subgroup) and give some related properties. especially,we state and prove the representation theorem for these fuzzy generalizedsubgroups. next, using the concept of continuity of t-norms we obtain a correspondencebetween tf(g), the set of ...

Hierarchical representations, such as irregular pyramids, are the bases of several applications in the field of discrete imagery. So, ndimensional ”bottom-up” irregular pyramids can be defined as stacks of successively reduced n-dimensional generalized maps (n-G-maps) [11], each n-G-map being defined from the previous level by using removal and contraction operations defined in [8]. Our goal is...

A set D of vertices in a graph G = (V, E) is a weakly connected dominating set of G if D is dominating in G and the subgraph weakly induced by D is connected. The weakly connected domination number of G is the minimum cardinality of a weakly connected dominating set of G. The weakly connected domination subdivision number of a connected graph G is the minimum number of edges that must be subdiv...