In this paper we introduce and study the concepts of semisimple gamma modules , regular gamma modules and fully idempotent gamma modules as a generalization of semisimple ring. An module is called fully idempotent (semisimple , regular) if for all submodule of (every submodule is a direct summand, for each , there exists and such that . We study some properties and relationships between them.

     Due to the significant role in understanding cellular processes, the decomposition of Protein-Protein Interaction (PPI) networks into essential building blocks, or complexes, has received much attention for functional bioinformatics research in recent years. One of the well-known bi-clustering descriptors for identifying communities and complexes in complex networks, such as PPI networks, is modularity function.   The contribution of this paper is to introduce heuristic optimization models that can collaborate with the modularity function to improve its detection ability. The definitions of the formulated heuristics are based on nodes and different levels of their neighbor properties.  The modulari

          The use of silicon carbide is increasing significantly in the fields of research and technology. Topological indices enable data gathering on algebraic graphs and provide a mathematical framework for analyzing the chemical structural characteristics. In this paper, well-known degree-based topological indices are used to analyze the chemical structures of silicon carbides. To evaluate the features of various chemical or non-chemical networks, a variety of topological indices are defined. In this paper, a new concept related to the degree of the graph called "bi-distance" is introduced, which is used to calculate all the additive as well as multiplicative degree-based indices for the isomer of silicon carbide, Si₂

A new type of the connected domination parameters called tadpole domination number of a graph is introduced. Tadpole domination number for some standard graphs is determined, and some bounds for this number are obtained. Additionally, a new graph, finite, simple, undirected and connected, is introduced named weaver graph. Tadpole domination is calculated for this graph with other families of graphs.

The aim of this article is to introduce a new definition of domination number in graphs called hn-domination number denoted by . This paper presents some properties which show the concepts of connected and independent hn-domination. Furthermore, some bounds of these parameters are determined, specifically, the impact on hn-domination parameter is studied thoroughly in this paper when a graph is modified by deleting or adding a vertex or deleting an edge.

     We will provide a new method in this study that integrates two types of applications, namely Graph Theory and Conjugate Young Diagram, the idea of combining the graph and the Young diagram is presented by Ali And Mahmood, which is primarily based on the idea of the e-abacus diagram, the new method is called GCYD, it directly applies to the English letter section, which will be a two-layer coding. It makes it difficult to detect the word or sentence.

An automatic text summarization system mimics how humans summarize by picking the most ‎significant sentences in a source text. However, the complexities of the Arabic language have become ‎challenging to obtain information quickly and effectively. The main disadvantage of the ‎traditional approaches is that they are strictly constrained (especially for the Arabic language) by the ‎accuracy of sentence feature ‎functions, weighting schemes, ‎and similarity calculations. On the other hand, the meta-heuristic search approaches have a feature tha

tock markets changed up and down during time. Some companies’ affect others due to dependency on each other . In this work, the network model of the stock market is discribed as a complete weighted graph. This paper aims to investigate the Iraqi stock markets using graph theory tools. The vertices of this graph correspond to the Iraqi markets companies, and the weights of the edges are set ulrametric distance of minimum spanning tree.

In real world, almost all networks evolve over time. For example, in networks of friendships and acquaintances, people continually create and delete friendship relationship connections over time, thereby add and draw friends, and some people become part of new social networks or leave their networks, changing the nodes in the network. Recently, tracking communities encountering topological shifting drawn significant attentions and many successive algorithms have been proposed to model the problem. In general, evolutionary clustering can be defined as clustering data over time wherein two concepts: snapshot quality and temporal smoothness should be considered. Snapshot quality means that the clusters should be as precise as possible durin

This work describes, selenium (Se) films were deposited on clean glass substrates by dc planar magnetron sputtering technique.The dependence of sputtering deposition rate of Se film deposited on pressure and DC power has been studied. The optimum argon pressure has range (4x10-1 -8x10-2 )mbar. The optical properties such as absorption coefficient (α) was determined using the absorbance and transmission measurement from UnicoUV-2102 PC spectrophotometer, at normal incidence of light in the wavelength range of 200-850 nm. And also we calculated optical constants(refractive index (n), dielectric constant (εi,r), and Extinction coefficient (κ) for selenium films.