Gutman Connection Index of Graphs under Operations
Abstract
:1. Introduction
2. Preliminaries
- The minimum number of consecutive edges that occurred between the two nodes and is called the distance between them and is denoted by for .
- The cardinality of is is called the degree of node b of graph F and is denoted by .
- The cardinality of is called the connection number of node b of graph F and is denoted by .
- Degree of an edge is denoted by and is equal to , where for some .
- The minimum distance between the corresponding nodes of two edges and is called the distance between the two edges and is denoted by i.e., , where and .
- The distance between one edge and one node is defined as, where and .
- First derived graph is established from F when every edge of F is upgraded by a path of length 2 by including a new node in it. The newly included nodes are also called white or new vertices while and are called old/black nodes.
- Second derived graph is established from when a new node is again joined with the end nodes and of the respective edge .
- Third derived graph is established from when two white nodes and are further joined together if their respective edges and have one common end node in graph F.
- Fourth derived graph is established from when two white nodes and are further joined together if their respective edges and have one common end node in graph F.
- (i) and
- (ii) where is a white node with respective edge .
- (a) If F is a free graph, then
- (i) and
- (ii)
- (b) If F is a graph, then
- (i) , where and are number of and cycles joined with in F
- (ii) , where and are number of cycles joined with in F
- (a) If F is a free graph, then
- (i) and
- (ii) .
- (b) If F is a graph, then
- (i) where and is the number of and cycles joined with vertex .
- (ii) where and is the number of cycles in graph F joined with edge .
- (a) If F is a free graph, then
- (i) and
- (ii)
- (b) If F is a graph, then
- (i) where and vertex is connected with number of and cycles and
- (ii) where and edge is connected with the number of cycles in graph F
3. Mian Results
4. Conclusions
Author Contributions
Funding
Data Availability Statement
Conflicts of Interest
References
- Yan, F.; Shang, Q.; Xia, S.; Wang, Q.; Ma, P. Application of topological index in predicting ionic liquids densities by the quantitative structure property relationship method. J. Chem. Eng. 2015, 60, 734–739. [Google Scholar] [CrossRef]
- Devillers, J.; Balaban, A.T. Topological Indices and Related Descriptors in QSAR and QSPR; Gordon and Breach: Amsterdam, The Netherlands, 1999. [Google Scholar]
- Diudea, M.V. QSPR/QSAR Studies by Molecular Descriptors; NOVA: New York, NY, USA, 2001. [Google Scholar]
- Todeschini, R.; Consonni, V.; Mannhold, R.; Kubinyi, H.; Timmerman, H. Handbook of Molecular Descriptors; Wiley-VCH: Weinheim, Germany, 2002. [Google Scholar]
- Wiener, H. Structural determination of paraffin boiling points. J. Am. Chem. Soc. 1947, 69, 17–20. [Google Scholar] [CrossRef] [PubMed]
- Gutman, I.; Trinajstic, N. Graph theory and molecular orbitals. Total π-electron energy of alternant hydrocarbons. Chem. Phys. Lett. 1972, 17, 535–538. [Google Scholar] [CrossRef]
- Dobrynin, A.A.; Kochetova, A.A. Degree distance of a graph, a degree analogue of the Wiener index. J. Chem. Inf. Comput. Sci. 1994, 34, 1082–1086. [Google Scholar] [CrossRef]
- Gutman, I. Selected properties of the Schultz molecular topological index. J. Chem. Inf. Comput. Sci. 1994, 34, 1087–1089. [Google Scholar] [CrossRef]
- Das, K.C.; Gutman, I. On Wiener and multiplicative Wiener indices of graphs. Discret. Appl. Math. 2016, 206, 9–14. [Google Scholar] [CrossRef]
- Das, K.C.; Gutman, I.; Nadjafi Arani, M.J. Relations between distance based and degree based topological indices. Appl. Math. Comput. 2015, 270, 142–147. [Google Scholar] [CrossRef]
- Gutman, I. Degree-based topological indices. Croat. Chem. Acta 2013, 86, 351–361. [Google Scholar] [CrossRef]
- Ali, A.; Trinajstic, N. A Novel/Old Modification of the First Zagreb Index. Mol. Inf. 2018, 37, 1800008. [Google Scholar] [CrossRef]
- Javaid, M.; Siddique, M.K.; Ali, U. Novel Connection Based Indices of Several Wheel-Ralated Graph. Comput. J. Comb. Math. 2020, 2, 31–58. [Google Scholar]
- Javaid, M.; Siddique, M.K.; Boyah, E. Computing Gutman Connection Index of Thorn Graph. J. Math. 2021, 2021, 2289514. [Google Scholar] [CrossRef]
- Yan, W.; Yang, B.; Yeh, Y. The behavior of Wiener indices and polynomials of graphs under five graph decorations. Appl. Math. Lett. 2007, 20, 290–295. [Google Scholar] [CrossRef]
- Demirci, M.; Delen, S.; Cevik, A.S.; Cangul, I.N. Omega Index of Line and Total Graphs. J. Math. 2021, 2021, 5552202. [Google Scholar] [CrossRef]
- Das, K.C.; Shang, Y. Some extremal graph with respect to sombor index. Mathematics 2021, 9, 1202. [Google Scholar] [CrossRef]
- Das, K.C.; Çevik, A.S.; Cangul, I.N.; Shang, Y. On Sombor Index. Symmetry 2021, 13, 140. [Google Scholar] [CrossRef]
- Javaid, M.; Ali, U.; Liu, J.B. Computing analysis for first Zagreb connection index and coindex of resultant graphs. Math. Probl. Eng. 2021, 2021, 19. [Google Scholar] [CrossRef]
- Liu, J.B.; Javed, S.; Javaid, M.; Shabbir, K. Computing first general zagreb index of operations on graphs. IEEE Access 2017, 7, 47494–47502. [Google Scholar] [CrossRef]
- Xu, J.; Liu, J.B.; Bilal, A.; Ahmad, U.; Saddiqui, H.M.A.; Ali, B.; Farhani, M.A. Degree Distance Index of Some Derived Graphs. Mathematics 2019, 7, 283. [Google Scholar] [CrossRef] [Green Version]
- Bahadur, A.; Imran, M.; Malik, M.A.; Saddiqui, H.M.A.; Bilal, A.; Farhani, M.R. Gutman Index of some derived graphs. Adv. Appl. Discret. Math. 2019, 20, 165–184. [Google Scholar]
- Farid, F.; Javaid, M.; Bonyah, E. Computing Connection Distance Index of derived graphs. Math. Probl. Eng. 2022, 2022, 1439177. [Google Scholar] [CrossRef]
- Diestel, R. Graph Theory; Springer: New York, NY, USA, 2000. [Google Scholar]
- Flapan, E. When Topology Meets Chemistry; Cambridge University Press and the Mathematical Association of America: Cambridge, UK, 2000. [Google Scholar]
- West, D.B. Introduction to Graph Theory; Prentice Hall, Inc.: Upper Saddle River, NJ, USA, 1996. [Google Scholar]
- Iranmanesh, A.; Gutman, I.; Khormali, O.; Mahmiani, A. The edge versions of the Wiener index. Match 2009, 61, 663. [Google Scholar]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2022 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).
Share and Cite
Alrowaili, D.A.; Farid, F.; Javaid, M. Gutman Connection Index of Graphs under Operations. Symmetry 2023, 15, 21. https://doi.org/10.3390/sym15010021
Alrowaili DA, Farid F, Javaid M. Gutman Connection Index of Graphs under Operations. Symmetry. 2023; 15(1):21. https://doi.org/10.3390/sym15010021
Chicago/Turabian StyleAlrowaili, Dalal Awadh, Faiz Farid, and Muhammad Javaid. 2023. "Gutman Connection Index of Graphs under Operations" Symmetry 15, no. 1: 21. https://doi.org/10.3390/sym15010021
APA StyleAlrowaili, D. A., Farid, F., & Javaid, M. (2023). Gutman Connection Index of Graphs under Operations. Symmetry, 15(1), 21. https://doi.org/10.3390/sym15010021