DBN Rashid, International Journal of Innovation, Creativity and Change, 2020

We have chosen the subject of the research (the letters at Ibn Jinnie in the lexicon of the tongue of the Arabs) in order to know the opinion of Ibn Jinnie in this range of words and compare them with the opinions of scientists who preceded him to know the personality of this linguistic world.

Arabic calligraphy has great importance in the printing designs that are often on the written character-based to perform functional goals and to achieve some of the aesthetic values ​​in design work, has led major developments in the field of computer manufacturing and design software for the design and layout to increase to deal with the programmed character for the purposes of typesetting has confronted this Find the Arab character programmed for the purposes of typesetting for the detection of the most important design interventions that underwent the Arabic letter written to turn it into a programmed image intended for the purposes of the printing and typesetting has been addressed in the context of which the theoretical types of

Suppose that  is a finite group and  is a non-empty subset of  such that  and . 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  that  is a graph with vertex set consists of all column matrices  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 similar entry of  and  is  matrix with all entries in  ,  is the transpose of  and . In this paper, we clarify some basic properties of the new graph and assign the structure of  when  is complete graph , complete bipartite graph  and complete

A topological index, commonly referred to as a connectivity index, is a molecular structural descriptor that describes a chemical compound's topology. Topological indices are a major topic in graph theory. In this paper, we first define a new graph, which is a concept from the coronavirus, called a corona graph, and then we give some theoretical results for the Wiener and the hyper Wiener index of a graph, according to ( the number of pairs of vertices (u, v) of G that are at a distance . Moreover, calculate some topological indices degree-based, such as the first and second Zagreb index, ,  and  index, and first and second Gourava index for the recent graph. In addition, we introduced a new topological index, the , w

In This paper, we introduce the associated graphs of commutative KU-algebra. Firstly, we define the KU-graph which is determined by all the elements of commutative KU-algebra as vertices. Secondly, the graph of equivalence classes of commutative KU-algebra is studied and several examples are presented. Also, by using the definition of graph folding, we prove that the graph of equivalence classes and the graph folding of commutative KU-algebra are the same, where the graph is complete bipartite graph.

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

Recently, complementary perfect corona domination in graphs was introduced. A dominating set S of a graph G is said to be a complementary perfect corona dominating set (CPCD – set) if each vertex in  is either a pendent vertex or a support vertex and  has a perfect matching. The minimum cardinality of a complementary perfect corona dominating set is called the complementary perfect corona domination number and is denoted by . In this paper, our parameter hasbeen discussed for power graphs of path and cycle.

In this paper, a new idea to configure a special graph from the discrete topological space is given. Several properties and bounds of this topological graph are introduced. Such that if the order of the non-empty set equals two, then the topological graph is isomorphic to the complete graph. If the order equals three, then the topological graph is isomorphic to the complement of the cycle graph. Our topological graph has  complete induced subgraphs with order  or more. It also has a cycle subgraph. In addition, the clique number is obtained. The topological graph is proved simple, undirected, connected graph. It has no pendant vertex, no isolated vertex and no cut vertex. The minimum and maximum degrees are evaluated. So , the radius