Let G be a finite group and X be a conjugacy class of order 3 in G. In this paper, we introduce a new type of graphs, namely A₄-graph of  G, as a simple graph denoted by A₄(G,X) which has X as a vertex set. Two vertices,  x and y, are adjacent if and only if  x≠y and  x y^-1=y x^-1. General properties  of the A₄-graph as well as the structure of A₄(G,X) when G@ ³D₄(2) will be studied.

In this paper we introduce the notions of bi-ideal with respect to an element r
denoted by (r-bi- ideal ) of a near ring , and the notion fuzzy bi- ideal with respect
to an element of a near ring and the relation between F-r-bi-ideal and r-bi-ideal of
the near ring, we studied the image and inverse image of r-bi- ideal under
epimomorphism ,the intersection of r-bi- ideals and the relation between this ideal
and the quasi ideal of a near ring, also we studied the notion intuitionistic fuzzy biideal
with respect to an element r of the near ring N, and give some theorem about
this ideal .

Let  be a non-trivial simple graph. A dominating set in a graph is a set of vertices such that every vertex not in the set is adjacent to at least one vertex in the set. A subset  is a minimum neighborhood dominating set if  is a dominating set and if for every  holds. The minimum cardinality of the minimum neighborhood dominating set of a graph  is called as minimum neighborhood dominating number and it is denoted by  . A minimum neighborhood dominating set is a dominating set where the intersection of the neighborhoods of all vertices in the set is as small as possible, (i.e., ). The minimum neighborhood dominating number, denoted by , is the minimum cardinality of a minimum neighborhood dominating set. In other words, it is the

     The Syriac language is one of the ancient Semitic languages that appeared in the first century AD. It is currently used in a number of cities in Iraq, Turkey, and others. In this research paper, we tried to apply the work of  Ali and Mahmood 2020  on the letters and words in the Syriac language to find a new encoding for them and increase the possibility of reading the message by other people.

The aerodynamic characteristics of general three-dimensional rectangular wings are considered using non-linear interaction between two-dimensional viscous-inviscid panel method and vortex ring method. The potential flow of a two-dimensional airfoil by the pioneering Hess & Smith method was used with viscous laminar, transition and turbulent boundary layer to solve flow about complex configuration of airfoils including stalling effect. Viterna method was used to extend the aerodynamic characteristics of the specified airfoil to high angles of attacks. A modified vortex ring method was used to find the circulation values along span wise direction of the wing and then interacted with sectional circulation obtained by Kutta-Joukowsky theorem of

Advances in digital technology and the World Wide Web has led to the increase of digital documents that are used for various purposes such as publishing and digital library. This phenomenon raises awareness for the requirement of effective techniques that can help during the search and retrieval of text. One of the most needed tasks is clustering, which categorizes documents automatically into meaningful groups. Clustering is an important task in data mining and machine learning. The accuracy of clustering depends tightly on the selection of the text representation method. Traditional methods of text representation model documents as bags of words using term-frequency index document frequency (TFIDF). This method ignores the relationship an

     . Suppose that  is the Cayley graph whose vertices are all elements of  and two vertices  and  are adjacent if and only if . In this paper,we introduce the generalized Cayley graph denoted by  which is a graph with a vertex set consisting of all column matrices  in which all components are in  and two vertices  and  are adjacent if and only if , where  is a column matrix that each entry is the inverse of the similar entry of  and  is  matrix with all entries in  ,  is the transpose of  and  and m . We aim to provide some basic properties of the new graph and determine the structure of  when  is a complete graph  for every , and n, m  .

Maplesoft is a technical computation forms which is a heart of problem solving in mathematics especially in graph theory. Maplesoft has established itself as the computer algebra system for researchers. Maplesoft has more mathematical algorithms which is covering a wide range of applications. A new family ( ) of 6-bridge graph still not completely solved for chromatic number, chromatic polynomial and chromaticity. In this paper we apply maplesoft on a kind of 6-bridge graph ( ) to obtain chromatic number, chromatic polynomial and chromaticity. The computations are shown that graph contents 3 different colours for all vertices, 112410 different ways to colour a graph such that any two adjacent vertices have different colour by using 3 dif

     In this paper we tend to describe the notions of intuitionistic fuzzy asly ideal of ring indicated by (I. F.ASLY) ideal and, we will explore some properties and connections about this concept.