Assume that G is a finite group and X is a subset of G. The commuting graph is denoted by С(G,X) and has a set of vertices X with two distinct vertices x, y Î X, being connected together on the condition of xy = yx. In this paper, we investigate the structure of Ϲ(G,X) when G is a particular type of Leech lattice groups, namely Higman–Sims group HS and Janko group J₂, along with  X as a G-conjugacy class of elements of order 3. We will pay particular attention to analyze the discs’ structure and determinate the diameters, girths, and clique number for these graphs.

  In the present paper, Arabic Character Recognition  Edge detection method based on contour and connected components  is proposed. First stage contour extraction feature is introduced to tackle the Arabic characters edge detection problem, where the aim is to extract the edge information presented in the Arabic characters, since it is crucial to understand the character content.         The second stage connected components appling for the same characters to find edge detection. The proposed approach exploits a number of connected components, which move on the character by character intensity values, to establish matrix, which represents the edge information at each pixel location .

In this paper, a national grid-connected photovoltaic (PV) system is proposed. It extracts the maximum power point (MPP) using three-incremental-steps perturb and observe (TISP&O) maximum power point tracking (MPPT) method. It improves the classic P&O by using three incremental duty ratio (ΔD) instead of a single one in the conventional P and O MPPT method. Therefore, the system's performance is improved to a higher speed and less power fluctuation around the MPP. The Boost converter controls the MPPT and then is connected to a three-phase voltage source inverter (VSI). This type of inverter needs a high and constant input voltage. A second-order low pass (LC) filter is connected to the output of VSI to reduce t

     A graph is a structure amounting to a set of objects in which some pairs of the objects are in some sense related. The objects correspond to mathematical abstractions called vertices (also called nodes or points) and each of the related pairs of vertices is called an edge (also called link or line). A directed graph is a graph in which edges have orientation. A simple graph is a graph that does not have more than one edge between any two vertices and no edge starts and ends at the same vertex.  For a simple undirected graph G with order n, and let  denotes its complement. Let δ(G), ∆(G) denotes the minimum degree and maximum degree of G respectively. The complement degree polynomial of G is the polynomial CD[G,x]= , where C

This paper is devoted to the discussion the relationships of connectedness between some types of graphs (resp. digraph) and Gm-closure spaces by using graph closure operators.

F index is a connected graph, sum of the cubes of the vertex degrees. The forgotten topological index has been designed to be employed in the examination of drug molecular structures, which is extremely useful for pharmaceutical and medical experts in understanding the biological activities. Among all the topological indices, the forgotten index is based on degree connectivity on bonds. This paper characterized the forgotten index of union of graphs, join graphs, limits on trees and its complements, and accuracy is measured. Co-index values are analyzed for the various molecular structure of chemical compounds

Let  be a module over a commutative ring  with identity. In this paper we intoduce the concept of Strongly Pseudo Nearly Semi-2-Absorbing submodule, where a  proper submodule  of an -module  is said to be Strongly Pseudo Nearly Semi-2-Absorbing submodule of   if whenever , for implies that either  or , this concept is a generalization of 2_Absorbing submodule, semi 2-Absorbing submodule, and strong form of (Nearly–2–Absorbing, Pseudo_2_Absorbing, and Nearly Semi–2–Absorbing) submodules. Several properties characterizations, and examples concerning this new notion are given. We study the relation between Strongly Pseudo Nearly Semei-2-Absorbing submodule and (2_Absorbing, Nearly_2_Absorbing, Pseudo_2_Absorbing, and Nearly S

Let  be a module over a commutative ring  with identity. Before studying the concept of the Strongly Pseudo Nearly Semi-2-Absorbing submodule, we need to mention the ideal  and the basics that you need to study the  concept of the Strongly Pseudo Nearly Semi-2-Absorbing submodule. Also, we introduce several characteristics of the Strongly Pseudo Nearly Semi-2-Absorbing submodule in classes of multiplication modules and other types of modules. We also had no luck because the ideal  is not a Strongly Pseudo Nearly Semi-2-Absorbing ideal. Also, it is noted that  is the Strongly Pseudo Nearly Semi-2-Absorbing ideal under several conditions, which is this faithful module, projective module, Z-regular module and content module and non-si

An R-module M is called rationally extending if each submodule of M is rational in a direct summand of M. In this paper we study this class of modules which is contained in the class of extending modules, Also we consider the class of strongly quasi-monoform modules, an R-module M is called strongly quasi-monoform if every nonzero proper submodule of M is quasi-invertible relative to some direct summand of M. Conditions are investigated to identify between these classes. Several properties are considered for such modules