Let G and H be graphs. The strong product GH of graphs G and H is the graph with vertex set V(G)V(H) and u=(u1, v1) is adjacent with v= (u2, v2) whenever (v1 = v2 and u1 is adjacent with u2) or (u1 = u2 and v1 is adjacent with v2) or (u1 is adjacent with u2 and v1 is adjacent with v2). In this paper, we first collect the earlier results about strong product and then we present applications of ...

the komshecheh barite-fluorite deposit is the product of epigenetic hydrothermal mineralizationin dolomitized limestone of middle triassic age. the deposit is structurally and lithologically controlled andoccurs predominantly as bedded stratabound replacement sheets, although the veins and solution-collapsebreccias constitute important modes of occurrence. brecciation, dolomitization, silicific...

abstractepidermal inclusion cysts are uncommon in the breast, but the consequences can besevere when these cysts occur in the breast parenchyma. here, we report two suchcases. the patient in case 1 was an 37-year-old woman with a 3-cm palpable mass inthe right breast. mammography revealed a round and smoothly outlined mass, whichindicated a benign tumor, and sonography showed an irregularly sha...

In this manuscript, we introduce  a new class of fuzzy problems, namely ``fuzzy inclusion linear systems" and   propose a fuzzy solution set for it. Then, we present a theoretical discussion about the relationship between  the fuzzy solution set of a  fuzzy inclusion linear system and the algebraic solution of a fuzzy linear system. New necessary and sufficient conditions are derived for obtain...

Supermolecular quantum dots (QDs) nanofluids have been firstly proposed and synthesized by virtue of the strong inclusion interactions between α-cyclodextrin (α-CD) and polyethylene glycol (PEG) chains, resulting in tunable liquid-like behaviour, and controllable assembly of single QDs.

It is known that every multigraph with an even number of edges has an even orientation (i.e., all indegrees are even). We study parity constrained graph orientations under additional constraints. We consider two types of constraints for a multigraph G = (V,E): (1) an exact conflict constraint is an edge set C ⊆ E and a vertex v ∈ V such that C should not equal the set of incoming edges at v; (2...

We study Lascar strong types and Galois types and especially their relation to notions of type which have finite character. We define a notion of a strong type with finite character, so called Lascar type. We show that this notion is stronger than Galois type over countable sets in simple and superstable finitary AECs. Furthermore we give and example where the Galois type itself does not have f...

We present an algorithm for generating elliptic curves of prime order over Optimal Extension Fields suitable for use in cryptography. The algorithm is based on the theory of Complex Multiplication. Furthermore, we demonstrate the efficiency of the algorithm in practice by giving practical running times. In addition, we present statistics on the number of cryptographically strong elliptic curves...