Open Access Review Article

General Fifth M-Zagreb Indices and General Fifth M-Zagreb Polynomials of Dyck-56 Network

Fozia Bashir Farooq*

Department of Mathematics, Al-Imam Mohammad Ibn Saud Islamic University, Riyadh, Saudi Arabia

Corresponding Author

Received Date: August 31, 2021;  Published Date: September 23, 2021

Abstract

A topological index is a type of molecular index that is calculated from the molecular graph of chemical structure. A topological index relates chemical structure with its underlying physical, biological and chemical properties. This article deals with General fifth M1 and General fifth M2– Zagreb indices and General fifth M1 and general fifth M2–Zagreb polynomials of Dyck-56𝑛×𝑛 network.

Keywords: Dyck-56 Network; Zagreb index; Zagreb polynomial

Introduction

A chemical graph can be represented by polynomial, a numerical value or a matrix form. Topological indices are major source of the relationship between physical and biological properties and behavior of chemical structures. Topological indices are used in development quantitative structure activity relationships in which properties of molecules are correlated with their chemical structure. Let 𝐺(𝑉, 𝐸) be a graph with vertex set 𝑉 and edge set 𝐸, with |𝑉| = π‘š and |𝐸| = 𝑛. Let 𝑑𝑒 represent the degree of a vertex 𝑒 in graph 𝐺. 𝑆𝑒 stands for sum of degrees of the vertices incident with vertex 𝑒 in 𝐺. Milan Randic [1] introduced the first degree-based Topological index, i.e Randic Index, Defined as;

irispublishers-openaccess-biostatistics-biometric-applications

Furthermore, Bollabas and Erdos [2] introduced general Randic index as;

irispublishers-openaccess-biostatistics-biometric-applications

Gutman and Trinajstic [3] introduced first and second Zagreb indices as;

irispublishers-openaccess-biostatistics-biometric-applications
irispublishers-openaccess-biostatistics-biometric-applications

Recently in [4], Kulli introduced new indices that are general fifth 𝑀1- Zagreb indices denoted by 𝑀1 𝛼𝐺5(𝐺) and general fifth 𝑀2- Zagreb indices denoted by 𝑀2 𝛼𝐺5(𝐺) defined as;

irispublishers-openaccess-biostatistics-biometric-applications
irispublishers-openaccess-biostatistics-biometric-applications

The general fifth 𝑀1- Zagreb polynomial denoted by 𝑀1𝛼𝐺5(𝐺, π‘₯) and general fifth 𝑀2- Zagreb polynomial denoted by 𝑀𝛼2𝐺5(𝐺, π‘₯) is defined as;

irispublishers-openaccess-biostatistics-biometric-applications
irispublishers-openaccess-biostatistics-biometric-applications

Dyck-56𝑛×𝑛 Networks were built up by unit representation of Dyck−56 (Dyck 1880) by identification procedure. Further detail about formation of Dyck Network can be found in [5]. Dyck graph is the 3-regular graph with 32 vertices and 48 edges, having chromatic number 2 and chromatic index 3 with diameter 5. Further details of formation of Dyck- 56𝑛×𝑛 network can be found in [5,6]. Selvan and Naranyakar in [7] calculated general Randic Index, First Zagreb index, ABC and GA indices for Dyck-x, ABC and GA indices for Dyck-56𝑛×𝑛 network.

Main Results

Figure 1 Dyck-56𝑛×𝑛(𝐴) Network has 12𝑛2 + 4𝑛 vertices and 18𝑛2 − 2𝑛 edges. Based on the sum of the degrees of incident vertices to the end vertices of each edge, there are seven types of edges of Dyck-56𝑛×𝑛(𝐴) Network. This edge partition is presented in (Table 1) [8-10].

irispublishers-openaccess-biostatistics-biometric-applications

Table 1: Edge Partition of Dyck-56𝑛×𝑛(A) Network.

irispublishers-openaccess-biostatistics-biometric-applications

Theorem 1: Let 𝐺 be the graph Dyck-56𝑛×𝑛(𝐴) Network, and the general fifth 𝑀1- Zagreb index for 𝐺 is

irispublishers-openaccess-biostatistics-biometric-applications

Proof. Let 𝐺: = Dyck-56𝑛×𝑛(𝐴) Network; the above result can be found by using Table 1 and equation 5.
So,

irispublishers-openaccess-biostatistics-biometric-applications

Which further reduces to

irispublishers-openaccess-biostatistics-biometric-applications

Theorem 2: Let 𝐺 be the graph Dyck-56𝑛×𝑛(𝐴) Network, and the general fifth 𝑀2- Zagreb index for 𝐺 is

irispublishers-openaccess-biostatistics-biometric-applications

Proof. Let 𝐺 be Dyck-56𝑛×𝑛(𝐴) Network. The above result can be found using (Table 1) and equation 6.
So,

irispublishers-openaccess-biostatistics-biometric-applications

Which further reduces to

irispublishers-openaccess-biostatistics-biometric-applications

Theorem 3: Let 𝐺 be the graph Dyck-56𝑛×𝑛(𝐴) Network, and the general fifth 𝑀1- Zagreb polynomial for 𝐺 is [

irispublishers-openaccess-biostatistics-biometric-applications

Proof. Let 𝐺 be Dyck-56𝑛×𝑛(𝐴) Network. The above result can be found using (Table 1) and equation 7.
So,

irispublishers-openaccess-biostatistics-biometric-applications

Theorem 4: Let 𝐺 be the graph Dyck-56𝑛×𝑛(𝐴) Network, The general fifth 𝑀2- Zagreb polynomial for 𝐺 is

irispublishers-openaccess-biostatistics-biometric-applications

Proof. Let 𝐺 be Dyck-56𝑛×𝑛(𝐴) Network. The above result can be found by using (Table 1) and equation 7.
So,

irispublishers-openaccess-biostatistics-biometric-applications

Figure 2 Dyck-56𝑛×𝑛(𝐡) Network has 18𝑛2 βˆ’ 3𝑛 vertices and 24𝑛2 βˆ’ 4𝑛 + 8 edges. On the base of sum of degrees of incident vertices to end vertices of each edge there are seven types of edges of Dyck-56𝑛×𝑛(𝐡) Network. This edge partition is given in (Table 2) [11-13].

Theorem 5: Let 𝐺 be the graph Dyck-56𝑛×𝑛(𝐡) Network, The general fifth 𝑀1- Zegreb index for G is

irispublishers-openaccess-biostatistics-biometric-applications

Proof. Let 𝐺 be Dyck-56𝑛×𝑛(𝐴) Network, The above result can be found by using (Table 1) and equation 5.
So,

irispublishers-openaccess-biostatistics-biometric-applications

Theorem 6: Let G be the graph Dyck-56𝑛×𝑛(𝐡) Network. The general fifth 𝑀2- Zegreb index for G is

irispublishers-openaccess-biostatistics-biometric-applications

Proof. Let 𝐺 denotes Dyck-56𝑛×𝑛(𝐡) Network. The above result can be found by using (Table 2) and equation 6.

irispublishers-openaccess-biostatistics-biometric-applications

Table 2: Edge Partition of Dyck-56𝑛×𝑛(B) Network.

irispublishers-openaccess-biostatistics-biometric-applications
irispublishers-openaccess-biostatistics-biometric-applications

Theorem 7: Let 𝐺 be the graph Dyck-56𝑛×𝑛(𝐡) Network, The general fifth 𝑀1- Zagreb polynomial for 𝐺 is

irispublishers-openaccess-biostatistics-biometric-applications

Proof. Let 𝐺 is Dyck-56𝑛×𝑛(𝐡) Network, The above result can be found by using (Table 2) and equation 7. So,

irispublishers-openaccess-biostatistics-biometric-applications

Theorem 8: Let G be the graph Dyck-56𝑛×𝑛(𝐡) Network, The general fifth 𝑀2- Zegreb polynomial for G is

irispublishers-openaccess-biostatistics-biometric-applications

Proof. Let 𝐺 be Dyck-56𝑛×𝑛(𝐡) Network. The above result can be found by using (Table 2) and equation 8.

irispublishers-openaccess-biostatistics-biometric-applications

Conclusion

Degree based topological indices like General fifth M1 and General fifth M2 Zagreb indices for Dyck-56 Network are found in this paper. These indices are useful in study of QSAR/QSPR. Furthermore, General fifth M1 and General fifth M2-Zagreb polynomials for Dyck-56 Networks are found. These indices and polynomials are useful for the study to understand correlation between physical structures with chemical properties.

Acknowledgement

None.

Conflict of Interest

No conflict of interest.

References

  1. Randic M (1975) On Characterization of molecular branching. J Am Chem Soc 97: 6609–6615.
  2. A Graovac, M Ghorbani, MA Hosseinzadeh (2011) Computing _fth geometric- arithmetic index of nanostar dendrimers. Journal of Mathematical Nanoscience1(1): 33-42.
  3. Bollobás, B, Erdös P (1998) Graphs of extermal weights. Ars Comb 50: 225-233.
  4. Gutman I, Trinajstic N (1972) Graph theory and molecular orbitals. Total φ-electron energy of alternant hydrocarbons. Chem Phys Lett 17(4): 535-538.
  5. MV Diudea, Cs L Nagy (2013) Diamond and related Nanostructures, Springer.
  6. Mircea V Diudea, Katalin Nagy, Monica L Pop, F Gholami Nezhaad, AR Ashrafi (2010) Omega and PIv Polynomial in Dyck Graph-like Z(8)-Unit Networks. Int J Nanosci Nanotechnol 6(2): 97-103.
  7. D Selwan, KP Prayankar (2020) On Topological Properties of Dyck-56 Networks. International Journal of Applied Graph Theory 4(1): 1-15.
  8. VR Kulli (2017) General Fifth M-Zagreb Indices and Fifth M-Zagreb Polynomials of PAMAM Dendrimers. Intern J Fuzzy Mathematical Archive 13(1): 99-103.
  9. Munir M, Nazeer W, Rafique S, Kang S (2016) M-polynomial and degree-based topological indices of polyhex nanotubes. Symmetry 8:149.
  10. Gao W, Wang W, Farahani MR (2016) Topological indices study of molecular structure in anticancer drugs. J Chem.
  11. Hayat S, Imran M (2015) On degree based topological indices of certain nanotubes. J Comput Nanosci 12: 1599-1605.
  12. Yang H, Rashid MA, Ahmad S, Khan SS, Siddiqui MK (2019) On molecular descriptors of face-centered cubic lattice. Processes 7: 280.
  13. DH Rouvray (1987) The modeling of chemical phenomena using topological indices. Journal of computational chemistry 8: 470.
Citation
Keywords
Signup for Newsletter
Scroll to Top