Browsing by Author "Baig, Abdul Qudair"
Now showing 1 - 5 of 5
- Results Per Page
- Sort Options
Article The First and Second Zagreb Polynomial and the Forgotten Polynomial of Cmxcn(Sami Publishing Co-spc, 2020) Afzal, Farkhanda; Afzal, Deeba; Baig, Abdul Qudair; Farahani, Mohammad Reza; Cancan, Murat; Ediz, SuleymanIn this paper, the 1st and 2nd Zagreb polynomials and the forgotten polynomial of C(m)xC(n) were computed. Some degree-based topological indices such as 1st and 2nd multiple Zagreb indices, Hyper Zagreb index and the forgotten index or F-index of the given networks were also computed. In addition, we represented the outcome by graphical representation that describe the dependence of topological indices on the given parameters of polynomial structures.Article Geometric Arithmetic and Mostar Indices of P2n +f Pn+1(Analytic Publ Co, 2020) Cancan, Murat; Naeem, Muhammad; Aslam, Aneela; Gao, Wei; Baig, Abdul QudairLet G = (V, E) be a simple connected graph, where V(G) and E(G) represent the vertex set and edge set of G respectively. The vertex set V(G) associates with the atoms and the edge set E(G) associates with the bonds of the atoms in a chemical graph. For a connected graph G, the second geometric-arithmetic index GA(v)(G) index is denoted as GA(1)(G) = Sigma(e=uv is an element of E(G)) 2 root d(u)xd(v)/d(u)+d(v), and the Mostar M-o(G) index of a graph G is formulated by GA(v)(G) = Sigma(e=uv is an element of E(G)) 2 root n(u)(e)xn(v)(e)/n(u)(e)+n(v)(e), where n(u)(e) is the number of vertices which are closer to the vertex u than to vertex v of e and n(v)(e) is the number of vertices which are closer to vertex v than to the vertex u of e. The aim of this paper is to calculate and compare the geometric-arithmetic GA(v)(G) index and Mostar M-o(G) index of P-2n+P-F(n+1).Article On Modified Eccentric Connectivity Index of Namn Nanotube(Analytic Publ Co, 2020) Sajjad, Wasim; Sardar, Muhammad Shoaib; Cancan, Murat; Ediz, Suleyman; Baig, Abdul QudairEccentricity based topological indices have attracted large attraction in the field of chemical graph theory. Eccentricity based topological indices are prominent due to their wide range applications. With the help of eccentricity based topological indices we can predict excellent accuracy rate in certain biological activities of diverse nature as com-pared to other indices. Carbon nanotubes are the cylindrical molecules that consist of rolled up sheets of carbon atoms. In this paper we consider the chemical graph of NA(m)(n) nanotube and compute an important eccentricity based topological index called Modified eccentric connectivity index.Article Some Topological Descriptors and Algebraic Polynomials of Pm+fpm(Sami Publishing Co-spc, 2020) Baig, Abdul Qudair; Amin, Adnan; Farahani, Mohammad Reza; Imran, Muhammad; Cancan, Murat; Aldemir, Mehmet SerifA topological index of G is a quantity related to G that characterizes its topology. Properties of the chemical compounds and topological invariants are related to each other. In this paper, we derive the algebraic polynomials including first and second Zagreb polynomials, and forgotten polynomial for Pm+FPm. Further, we worked on the hyper-Zagreb, first and second multiple Zagreb indices, and forgotten index of these graphs. Consider the molecular graph with atoms to be taken as vertices and bonds can be shown by edges. For such graphs, we can determine the topological descriptors showing their bioactivity as well as their physiochemical characteristics. Moreover, we derive graphical representation of our outcomes, depicting the technical dependence of topological indices and polynomials on the involved structural parameters.Article Vertex Szeged Indices of P2n(Analytic Publ Co, 2020) Cancan, Murat; Naeem, Muhammad; Baig, Abdul Qudair; Gao, Wei; Aslam, AneelaLet G=(V,E) be a simple connected graph, where V(G) and E(G) represent the vertex set and edge set of G respectively. For a graph the vertex Szeged index is equal to the product over all edges uv of G of the number of vertices which are not equidistant to vertices u and v. The vertex Padmarker-Ivan (PIv) index of a graph is the sum over all edges uv of G of the number of vertices which are not equidistant to vertices u and v. The aim of this paper is to compute and compare the vertex Szeged index and vertex Padmarker-Ivan (PIv) index of P2n+F Pn+1, where P2n+F Pn+1 represents four operation on P(2n)xP(n+1).