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.

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.

With simple and undirected connected graph Φ, the Schultz and modified Schultz polynomials are defined as  and , respectively, where the summation is taken over all unordered pairs of distinct vertices in V(Φ), where V(Φ) is the vertex set of Φ, degu  is the degree of vertex u and d(v,u) is the ordinary distance between v and u, u≠v. In this study, the Shultz distance, modified Schultz distance, the polynomial, index, and average for both have been generalized, and this generalization has been applied  to some special graphs.

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

      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.

 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

     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

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.

     Let  be any connected graph with vertices set  and edges set .  For any two distinct vertices  and , the detour distance between  and  which is denoted by  is a longest path between  and  in a graph . The detour polynomial of a connected graph  is denoted by ;  and is defined by . In this paper, the detour polynomial of the theta graph and the uniform theta graph will be computed.

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.