Preferred Language
Articles
/
ijs-3179
M_n – Polynomials of Some Special Graphs

 Let  be a connected graph with vertices set  and edges set . The ordinary distance between any two vertices of  is a mapping  from  into a nonnegative integer number such that  is the length of a shortest  path. The maximum distance between two subsets  and  of   is the maximum distance between any two vertices  and  such that  belong to  and  belong to . In this paper, we take a special case of maximum distance when  consists of one vertex and  consists of  vertices, . This distance is defined by: where  is the order of  a graph .

     In this paper, we defined  – polynomials based on the maximum distance between a vertex  in  and a subset  that has vertices of a vertex set of  and  – index. Also, we find  polynomials for some special graphs, such as: complete, complete bipartite, star, wheel, and fan graphs, in addition to  polynomials of path, cycle, and Jahangir graphs. Then we determine the indices of these distances.

Scopus Crossref
View Publication Preview PDF
Quick Preview PDF
Publication Date
Tue Jan 01 2019
Journal Name
Ieee Access
Scopus (40)
Crossref (39)
Scopus Clarivate Crossref
View Publication
Publication Date
Tue Jun 01 2021
Journal Name
Baghdad Science Journal
Numerical Solution for Linear Fredholm Integro-Differential Equation Using Touchard Polynomials

A new method based on the Touchard polynomials (TPs) was presented for the numerical solution of the linear Fredholm integro-differential equation (FIDE) of the first order and second kind with condition. The derivative and integration of the (TPs) were simply obtained. The convergence analysis of the presented method was given and the applicability was proved by some numerical examples. The results obtained in this method are compared with other known results.

 

Scopus (4)
Crossref (3)
Scopus Clarivate Crossref
View Publication Preview PDF
Publication Date
Tue Aug 31 2021
Journal Name
Iraqi Journal Of Science
Investigation of Commuting Graphs for Elements of Order 3 in Certain Leech Lattice Groups

      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 J2, 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.

Scopus (2)
Scopus Crossref
View Publication Preview PDF
Publication Date
Tue Jan 01 2019
Journal Name
Indian Journal Of Public Health Research & Development
The Effect of Special Exercises for those with (Cognitive Concentration) in the Development of Motor Satisfaction and Learning Some Types of Scoring Basketball for Students

The importance of the research in the preparation of special exercises to develop some types of basketball scoring as a contribution to help the physical education teacher to find successful educational alternatives. The purpose of the study was to prepare special exercises for the cognitive (cognitive) survey in the development of motor satisfaction and learning some types of Scoring for basketball for students. Learn about the effect of cognitive exercises in cognitive development in students. The survey included students from the first stage of the Faculty of Physical Education and Sports Science \ University of Diyala (159) divided into 6 people. The sample was randomized by (b) and (b) D) and after dispersion by the standard method In

... Show More
Scopus Crossref
View Publication
Publication Date
Thu Oct 01 2020
Journal Name
Alexandria Engineering Journal
Crossref (5)
Crossref
View Publication
Publication Date
Thu Oct 01 2020
Journal Name
Alexandria Engineering Journal
Scopus (8)
Crossref (5)
Scopus Clarivate Crossref
Publication Date
Sun Jan 01 2023
Journal Name
Journal Of Interdisciplinary Mathematics
Studying the result involution graphs for HS and McL Leech lattice groups

Let G be a finite group, the result is the involution graph of G, which is an undirected simple graph denoted by the group G as the vertex set and x, y ∈ G adjacent if xy and (xy)2 = 1. In this article, we investigate certain properties of G, the Leech lattice groups HS and McL. The study involves calculating the diameter, the radius, and the girth of ΓGRI.

Scopus Clarivate Crossref
View Publication
Publication Date
Wed Nov 30 2022
Journal Name
Iraqi Journal Of Science
Pointwise Estimates for Finding the Error of Best Approximation by Spline, Positive Algebraic Polynomials and Copositive

     The first step in this research is to find some of the necessary estimations in approximation by using certain algebraic polynomials, as well as we use certain specific points in approximation. There are many estimations that help to find the best approximation using algebraic polynomials and geometric polynomials. Throughout this research, we deal with some of these estimations to estimate the best approximation error using algebraic polynomials where the basic estimations in approximation are discussed and proven using algebraic polynomials that are discussed and proven using algebraic polynomials that are specified by the following points and  if   as well as if   .

  For the second step of the work, the estimatio

... Show More
Scopus Crossref
View Publication Preview PDF
Publication Date
Tue Nov 19 2024
Journal Name
Journal Of Physical Education
View Publication
Publication Date
Sun Dec 31 2023
Journal Name
Iraqi Journal Of Information And Communication Technology
EEG Signal Classification Based on Orthogonal Polynomials, Sparse Filter and SVM Classifier

This work implements an Electroencephalogram (EEG) signal classifier. The implemented method uses Orthogonal Polynomials (OP) to convert the EEG signal samples to moments. A Sparse Filter (SF) reduces the number of converted moments to increase the classification accuracy. A Support Vector Machine (SVM) is used to classify the reduced moments between two classes. The proposed method’s performance is tested and compared with two methods by using two datasets. The datasets are divided into 80% for training and 20% for testing, with 5 -fold used for cross-validation. The results show that this method overcomes the accuracy of other methods. The proposed method’s best accuracy is 95.6% and 99.5%, respectively. Finally, from the results, it

... Show More
Crossref
View Publication Preview PDF