let a; b; k 2 k and u ; v 2 u(k). we show for any idempotent e 2 k, ( a 0 b 0 ) is e-clean i ( a 0 u(vb + ka) 0 ) is e-clean and if ( a 0 b 0 ) is 0-clean, ( ua 0 u(vb + ka) 0 ) is too.

0

‎‎‎in this paper‎, ‎the‎ notion of injectivity with respect to order dense embeddings in ‎‎the category of $s$-posets‎, ‎posets with a monotone action of a‎ pomonoid $s$ on them‎, ‎is studied‎. ‎we give a criterion‎, ‎like the baer condition for injectivity of modules‎, ‎or skornjakov criterion for injectivity of $s$-sets‎, ‎for the order dense injectivity‎. ‎also‎, ‎we consider such injectivit...

In this paper an efficient method is developed for the analysis of non-regular graphs which contain regular submodels. A model is called regular if it can be expressed as the product of two or three subgraphs. Efficient decomposition methods are available in the literature for the analysis of some classes of regular models. In the present method, for a non-regular model, first the nodes of the ...

Let $S$ be an ordered semigroup. A fuzzy subset of $S$ is anarbitrary mapping   from $S$ into $[0,1]$, where $[0,1]$ is theusual interval of real numbers. In this paper,  the concept of fuzzygeneralized bi-ideals of an ordered semigroup $S$ is introduced.Regular ordered semigroups are characterized by means of fuzzy leftideals, fuzzy right ideals and fuzzy (generalized) bi-ideals.Finally, two m...

We investigate regular realizability (RR) problems, which are the problems of verifying whether intersection of a regular language – the input of the problem – and fixed language called filter is non-empty. We consider two kind of problems depending on representation of regular language. If a regular language on input is represented by a DFA, then we obtain (deterministic) regular realizability...

Suppose every vertex of a graph G has degree k or k + 1 and at least one vertex has degree k + 1. It is shown that if k > 2q 2 and q is a prime power then G contains a q-regular subgraph (and hence an r-regular subgraph for all r < q. r = q (mod 2)). It is also proved that every simple graph with maximal degree A > 2q 2 and average degree d > ((2q 2)/(2q l))(A + 1), where q is a prime power, co...

In [3] Cameron et al. classified strongly regular graphs with strongly regular subconstituents. Here we prove a theorem which implies that distance-regular graphs with strongly regular subconstituents are precisely the Taylor graphs and graphs with a1 = 0 and ai ∈ {0, 1} for i = 2, . . . , d .