Preferred Language
Articles
/
bsj-6350
Detour Polynomials of Generalized Vertex Identified of Graphs
...Show More Authors

The Detour distance is one of the most common distance types used in chemistry and computer networks today. Therefore, in this paper, the detour polynomials and detour indices of vertices identified of n-graphs which are connected to themselves and separated from each other with respect to the vertices for n≥3 will be obtained. Also, polynomials detour and detour indices will be found for another graphs which have important applications in Chemistry.

 

Scopus Crossref
View Publication Preview PDF
Quick Preview PDF
Publication Date
Wed Jun 01 2022
Journal Name
Baghdad Science Journal
Schultz and Modified Schultz Polynomials for Edge – Identification Chain and Ring – for Square Graphs
...Show More Authors

In a connected graph , the distance function between each pair of two vertices from a set vertex  is the shortest distance between them and the vertex degree  denoted by  is the number of edges which are incident to the vertex  The Schultz and modified Schultz polynomials of  are have defined as:

 respectively, where the summations are taken over all unordered pairs of distinct vertices in  and  is the distance between  and  in  The general forms of Schultz and modified Schultz polynomials shall be found and indices of the edge – identification chain and ring – square graphs in the present work.

View Publication Preview PDF
Scopus (3)
Crossref (1)
Scopus Clarivate Crossref
Publication Date
Sat Apr 01 2023
Journal Name
Baghdad Science Journal
Some K-Banhatti Polynomials of First Dominating David Derived Networks
...Show More Authors

Chemical compounds, characteristics, and molecular structures are inevitably connected. Topological indices are numerical values connected with chemical molecular graphs that contribute to understanding a chemical compounds physical qualities, chemical reactivity, and biological activity. In this study, we have obtained some topological properties of the first dominating David derived (DDD) networks and computed several K-Banhatti polynomials of the first type of DDD.

View Publication Preview PDF
Scopus Crossref
Publication Date
Tue Dec 01 2020
Journal Name
Baghdad Science Journal
Numerical Solution of Fractional Volterra-Fredholm Integro-Differential Equation Using Lagrange Polynomials
...Show More Authors

In this study, a new technique is considered for solving linear fractional Volterra-Fredholm integro-differential equations (LFVFIDE's) with fractional derivative qualified in the Caputo sense. The method is established in three types of Lagrange polynomials (LP’s), Original Lagrange polynomial (OLP), Barycentric Lagrange polynomial (BLP), and Modified Lagrange polynomial (MLP). General Algorithm is suggested and examples are included to get the best effectiveness, and implementation of these types. Also, as special case fractional differential equation is taken to evaluate the validity of the proposed method. Finally, a comparison between the proposed method and other methods are taken to present the effectiveness of the proposal meth

... Show More
View Publication Preview PDF
Scopus (3)
Crossref (1)
Scopus Clarivate Crossref
Publication Date
Thu Dec 01 2022
Journal Name
Baghdad Science Journal
The Approximation of Weighted Hölder Functions by Fourier-Jacobi Polynomials to the Singular Sturm-Liouville Operator
...Show More Authors

      In this work, a weighted H lder function that approximates a Jacobi polynomial which solves the second order singular Sturm-Liouville equation is discussed. This is generally equivalent to the Jacobean translations and the moduli of smoothness. This paper aims to focus on improving methods of approximation and finding the upper and lower estimates for the degree of approximation in weighted H lder spaces by modifying the modulus of continuity and smoothness. Moreover, some properties for the moduli of smoothness with direct and inverse results are considered.

View Publication Preview PDF
Scopus (2)
Scopus Clarivate Crossref
Publication Date
Wed Mar 01 2023
Journal Name
Baghdad Science Journal
Stability of Complement Degree Polynomial of Graphs
...Show More Authors

     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

... Show More
View Publication Preview PDF
Scopus (1)
Scopus Clarivate Crossref
Publication Date
Wed Mar 01 2023
Journal Name
Baghdad Science Journal
Quotient Energy of Zero Divisor Graphs And Identity Graphs
...Show More Authors

Consider the (p,q) simple connected graph . The sum absolute values of the spectrum of quotient matrix of a graph  make up the graph's quotient energy. The objective of this study is to examine the quotient energy of identity graphs and zero-divisor graphs  of commutative rings using group theory, graph theory, and applications. In this study, the identity graphs  derived from the group  and a few classes of zero-divisor graphs  of the commutative ring R are examined.

View Publication Preview PDF
Scopus (2)
Crossref (1)
Scopus Clarivate Crossref
Publication Date
Tue Dec 01 2020
Journal Name
Baghdad Science Journal
The Numerical Technique Based on Shifted Jacobi-Gauss-Lobatto Polynomials for Solving Two Dimensional Multi-Space Fractional Bioheat Equations
...Show More Authors

This article deals with the approximate algorithm for two dimensional multi-space fractional bioheat equations (M-SFBHE). The application of the collection method will be expanding for presenting a numerical technique for solving M-SFBHE based on “shifted Jacobi-Gauss-Labatto polynomials” (SJ-GL-Ps) in the matrix form. The Caputo formula has been utilized to approximate the fractional derivative and to demonstrate its usefulness and accuracy, the proposed methodology was applied in two examples. The numerical results revealed that the used approach is very effective and gives high accuracy and good convergence.

View Publication Preview PDF
Scopus (2)
Scopus Clarivate Crossref
Publication Date
Sun Nov 22 2020
Journal Name
Ibn Al-haitham Journal For Pure And Applied Sciences
Topological Structure of Generalized Rough Graphs
...Show More Authors

The main purpose of this paper, is to introduce a topological space , which is induced by reflexive graph and tolerance graph , such that  may be infinite. Furthermore, we offered some properties of  such as connectedness, compactness, Lindelöf and separate properties. We also study the concept of approximation spaces and get the sufficient and necessary condition that topological space is approximation spaces.

View Publication Preview PDF
Crossref
Publication Date
Mon Oct 01 2018
Journal Name
Journal Of Economics And Administrative Sciences
symmetric analysis of multiple variables classified ranked orthogonal polynomials
...Show More Authors

MCA has gained a reputation for being a very useful statistical method for determining the association between two or more categorical variables and their graphical description. For performance this method, we must calculate the singular vectors through (SVD). Which is an important primary tool that allows user to construct a low-dimensional space to describe the association between the variables categories. As an alternative procedure to use (SVD), we can use the (BMD) method, which involves using orthogonal polynomials to reflect the structure of ordered categorical responses. When the features of BMD are combined with SVD, the (HD) is formed. The aim of study is to use alternative method of (MCA) that is appropriate with order

... Show More
View Publication Preview PDF
Crossref
Publication Date
Thu Jun 01 2023
Journal Name
Baghdad Science Journal
Topological Indices Polynomials of Domination David Derived Networks
...Show More Authors

The chemical properties of chemical compounds and their molecular structures are intimately connected. Topological indices are numerical values associated with chemical molecular graphs that help in understanding the physicochemical properties, chemical reactivity and biological activity of a chemical compound. This study obtains some topological properties of second and third dominating David derived (DDD) networks and computes several K Banhatti polynomial of second and third type of DDD.

View Publication Preview PDF
Scopus (1)
Crossref (1)
Scopus Crossref