Consider a simple graph   on vertices and edges together with a total  labeling . Then ρ is called total edge irregular labeling if there exists a one-to-one correspondence, say  defined by  for all  where  Also, the value  is said to be the edge weight of . The total edge irregularity strength of the graph G is indicated by  and is the least  for which G admits   edge irregular h-labeling.  In this article,   for some common graph families are examined. In addition, an open problem is solved affirmatively.

All-optical canonical logic units at 40 Gb/s using bidirectional four-wave mixing (FWM) in highly nonlinear fiber are proposed and experimentally demonstrated. Clear temporal waveforms and correct pattern streams are successfully observed in the experiment. This scheme can reduce the amount of nonlinear devices and enlarge the computing capacity compared with general ones. The numerical simulations are made to analyze the relationship between the FWM efficiency and the position of two interactional signals. © 2015 Chinese Laser Press

Highly plastic soils exhibit unfavorited properties upon saturation, which produce different defects in engineering structures. Attempts were made by researchers to proffer solutions to these defects by experimenting in practical ways. This included various materials that could possibly improve the soil engineering properties and reduce environmental hazards. This paper investigates the strength behavior of highly plastic clay stabilized with brick dust. The brick dust contents were 10%, 20%, and 30% by dry weight of soil. A series of linear shrinkage and unconfined compression tests were carried out to study the effect of brick dust on the quantitative amount of shrinkage experienced by highly plastic clay and the undra

Let A be a unital algebra, a Banach algebra module M is strongly fully stable Banach A-module relative to ideal K of A, if for every submodule N of M and for each multiplier θ : N → M such that θ(N) ⊆ N ∩ KM. In this paper, we adopt the concept of strongly fully stable Banach Algebra modules relative to an ideal which generalizes that of fully stable Banach Algebra modules and we study the properties and characterizations of strongly fully stable Banach A-module relative to ideal K of A.

      In this work, we introduced and studied  a new kind of soft mapping  on soft topological spaces with an ideal, which we called  soft strongly generalized mapping with respect an ideal I, we studied the concepts like SSIg-continuous, Contra-SSIg-continuous, SSIg-open, SSIg-closed and SSIg-irresolute mapping  and  the relations between these kinds of mappings and the composition of two mappings of the same type of two different types, with proofs or counter examples

      Let S be a commutative ring with identity, and A is an S-module. This paper introduced an important concept, namely strongly maximal submodule. Some properties and many results were proved as well as the behavior of that concept with its localization was studied and shown.

        Throughout this paper, three concepts are introduced namely stable semisimple modules, stable t-semisimple modules and strongly stable t-semisimple. Many features co-related with these concepts are presented. Also many connections between these concepts are given. Moreover several relationships between these classes of modules and other co-related classes and other related concepts are introduced.

  The search is an application for one of the problems of mathematics in the computer; as providing construction and design of a major program to calculate the inverse permutations of the symmetric group Sn , where 1 ≤ n ≤ 13; using some of the methods used in the Number Theory by computer . Also the research includes design flow chart for the main program and design flow chart for the program inverse permutations and we give some illustrative examples for different symmetric groups and their inverse permutations.

Symmetric cryptography forms the backbone of secure data communication and storage by relying on the strength and randomness of cryptographic keys. This increases complexity, enhances cryptographic systems' overall robustness, and is immune to various attacks. The present work proposes a hybrid model based on the Latin square matrix (LSM) and subtractive random number generator (SRNG) algorithms for producing random keys. The hybrid model enhances the security of the cipher key against different attacks and increases the degree of diffusion. Different key lengths can also be generated based on the algorithm without compromising security. It comprises two phases. The first phase generates a seed value that depends on producing a rand