Research ArticleOpen AccessGoogle Scholar indexed
On the Sanskruti Index of Circumcoronene Series of Benzenoid
Colleage of Pharmacy and Biological Engineering, Chengdu University, Chengdu, China
Department of Applied Mathematics of Iran University of Science and Technology (IUST), Narmak, Tehran, Iran
Department of Mathematics, University of Management and Technology (UMT), Lahore, Pakistan
Department of Mathematics, University of Management and Technology (UMT), Lahore, Pakistan
- 1 Colleage of Pharmacy and Biological Engineering, Chengdu University, Chengdu, China
- 2 Department of Applied Mathematics of Iran University of Science and Technology (IUST), Narmak, Tehran, Iran
- 3 Department of Mathematics, University of Management and Technology (UMT), Lahore, Pakistan
- 4 Department of Mathematics, University of Management and Technology (UMT), Lahore, Pakistan
Copy link · social · email
Abstract
Let G = ( V ; E ) be a simple connected graph. The sets of vertices and edges of G are denoted by V = V ( G ) and E = E ( G ), respectively. In such a simple molecular graph, vertices represent atoms and edges represent bonds. The Sanskruti index S ( G ) is a topological index was defined as where S u is the summation of degrees of all neighbors of vertex u in G . The goal of this paper is to compute the Sanskruti index for circumcoronene series of benzenoid.
KeywordsSanskruti IndexMolecular GraphCircumcoronene Series of Benzenoid
- West, D.B. (1996) An Introduction to Graph Theory. Prentice-Hall, Upper Saddle River, NJ.
- Trinajstic, N. (1992) Chemical Graph Theory. CRC Press, Boca Raton, FL.
- Todeschini, R. and Consonni, V. (2000) Handbook of Molecular Descriptors. Wiley, Weinheim. https://doi.org/10.1002/9783527613106
- Randic, M. (1975) Characterization of Molecular Branching. Journal of the American Chemical Society, 97, 6609-6615. https://doi.org/10.1021/ja00856a001
- Hosamani, S.M. (2016) Computing Sanskruti Index of Certain Nanostructures. Journal of Applied Mathematics and Computing, 1-9.
- Brunvoll, J., Cyvin, B.N. and Cyvin, S.J. (1987) Enumeration and Classification of Benzenoid Hydrocarbons. Symmetry and Regular Hexagonal Benzenoids. Journal of Chemical Information and Computer Sciences, 27, 171-177. https://doi.org/10.1021/ci00056a006
- Chepoi, V. and Klavzar, S. (1998) Distances in Benzenoid Systems: Further Developments. Discrete Mathematics, 192, 27-39. https://doi.org/10.1016/S0012-365X(98)00064-8
- Dias, J.R. (1996) From Benzenoid Hydrocarbons to Fullerene Carbons. MATCH Communications in Mathematical and in Computer Chemistry, 4, 57-85.
- Diudea, M.V. (2003) Capra A Leapfrog Related Map Operation. Studia Universitatis Babes-Bolyai, 4, 3-21.
- Dress, A. and Brinkmann, G. (1996) Phantasmagorical Fulleroids. MATCH Communications in Mathematical and in Computer Chemistry, 33, 87-100.
- Ilic, A., Klavzar, S. and Stevanovic, D. (2010) Calculating the Degree Distance of Partial Hamming Graphs. MATCH Communications in Mathematical and in Computer Chemistry, 63, 411-424. http://match.pmf.kg.ac.rs/electronic_versions/Match63/n2/match63n2_411-424.pdf
- Klavzar, S. and Gutman, I. (1997) Bounds for the Schultz Molecular Topological Index of Benzenoid Systems in Terms of Wiener Index. Journal of Chemical Information and Computer Sciences, 37, 741-744. https://doi.org/10.1021/ci9700034
- Klavzar, S. (2008) A Bird’s Eye View of the Cut Method and a Survey of Its Applications in Chemical Graph Theory. MATCH Communications in Mathematical and in Computer Chemistry, 60, 255-274.
- Klavzar, S., Gutman, I. and Mohar, B. (1995) Labeling of Benzenoid Systems Which Reects the Vertex-Distance Relations. Journal of Chemical Information and Computer Sciences, 35, 590-593. https://doi.org/10.1021/ci00025a030