1. Introduction
Topological indices and algebraic graph theory are two closely linked subjects that focus on the mathematical study of graphs, having applications in chemistry, physics, computer science and social networks. Topological indices and algebraic graph theory are linked by a shared interest in graph analysis and representation. Although topological indices are a specific set of numerical measurements obtained from graph topology, algebraic graph theory gives mathematical tools and notions for studying graph features, which can be used to analysis and understand topological indices and vice versa.
A molecular graph is a type of topological representation of a molecule that represents the structure and connections of a molecule. These molecular graphs characterize numerous chemical aspects of molecules, such as their organic, chemical, or physical properties. They are critical in applications such as quantitative structure–activity relationship (QSAR) and quantitative structure–property relationship (QSPR) research, digital screens, and computational drug design [1,2]. Many topological indices have been used to characterize molecular graphs and many of these indices are good graph descriptors [3,4]. Furthermore, several of these indices have been discovered to correspond well with the organic, chemical, or physical characteristics of molecules [5,6,7,8,9,10,11,12,13,14,15,16,17]. As a result, they serve an important role in understanding and predicting molecular behavior and characteristics in a variety of chemical and pharmacological situations.
Graphs in mathematics are made up of vertices (which represent atoms) and edges (which represent chemical bonds). A molecular graph is a graph that represents the structure and connectivity of molecules and acts as a topological representation of the molecule. These molecular graphs are analyzed using a variety of topological indices, including distance-based topological indices, degree-based topological indices, and other derived indices. Distance-based topological indices, in particular, have an important role in chemical graph theory, notably in chemistry [18,19]. Each type of topological index offers unique information about the molecular graph and many have been presented to study different aspects of chemical compounds. Topological indices help in the analysis of molecular structures, property prediction, drug design, and other areas of chemical research.
Degree-based topological indices have undergone extensive research and have shown significant connections to various properties of the molecular compounds under study. The relationship between these indices is remarkably strong. Among the topological indexes derived from distance and degree in [20], degree-based topological indices stand out as the most widely recognized examples of such invariants. Numerical values exist that establish connections between the molecular structure and various physical properties, chemical reactivities and biological activities. These numerical values, known as topological indices, associate the molecular shape with specific physical properties, artificial reactivities, and natural biological activities [21,22].
In 1948, Shannon introduced the concept of entropy through his seminal paper [23]. Entropy, when applied to a probability distribution, serves as a measure of the predictability of information content or the uncertainty of a system. Subsequently, the application of entropy extended to graphs and chemical networks, enabling a deeper understanding of their structural information. Graph entropies have recently gained significance in various domains, including biology, chemistry, ecology, sociology, among others. The idea of entropy, which derives from statistical mechanics and information theory, quantifies how random or unpredictable a system is. Even though entropy is most frequently related to information theory, it may also be used to examine complex systems, networks, and patterns in algebraic structures and graphs. A detailed survey on the application of algebraic entropies over algebraic structure has been presented in [24]. The degree of each atom holds paramount importance, leading to substantial research in graph theory and network theory to explore invariants that have long served as information functionals in scientific studies. The chronological sequence of graph entropy measurements utilized to analyze biological and chemical networks [25,26,27]. Further, Das et al. investigated various results on topological indices and entropies in their research articles [28,29,30,31,32,33].
A graph that depends on algebraic structures such as group theory, number theory, and ring theory is known as an algebraic graph. In the field of algebraic graph theory, various problems are still open; the number of components problem of a graph, which depends on the modular relation, still remains a conjuncture. There are several algebraic graphs based on the algebraic structure that has been studied, but here we are going to discuss a zero-divisor graph that depends on the set of zero divisors of a ring R. A graph is known as a zero-divisor graph whose vertex set is the zero divisors of the modular ring , and two vertices will be adjacent to each other if their product will be zero under (mod n) [34]. The zero-divisor graph for is shown in Figure 1. For further understanding related to algebraic structure graphs and their properties, reader should can study [35,36,37,38,39,40].
The rest of the work is arranged as follows: In Section 2, some basic terminology related to topological indices are given to understand the proposed work. In Section 3 and Section 4, various topological indices over zero-divisor graphs and are discussed, respectively. Further, in these sections the behavior of investigated topological indices via numeric tables and three-dimensional discrete plotting are observed numerically and graphically. In Section 5, three kinds of entropies, i.e., first, second, and third redefined entropies, are founded over the families of zero-divisor graphs. In the last section, concluding remarks and further future works are discussed with detail.
2. Basic Terminology Related to Topological Indices and Entropies
In this section, we will discuss some well-known existing topological indices for various families of graphs [41,42,43,44,45,46,47,48,49] and M -polynomial [3,8], namely, first Zagreb , second Zagreb , second modified Zagreb , general Randics , inverse general Randics , third symmetric divisions , fifth symmetric divisions , harmonic , inverse sum , and forgotten topological index .
(1)
(2)
(3)
(4)
(5)
In chemical graph theory, the -polynomial is a topological index used to characterize the molecular structure of organic molecules. Researchers can acquire insights into the structural factors that determine the properties of molecules by analyzing the coefficients of different terms in the -polynomial. The -polynomial is defined as [3,8]
(6)
The relationship between -polynomial and topological indices are given in Table 1.
In 2013, Ranjini et al. introduced the first, second, and third redefined version of the Zagreb indices [50],
(7)
(8)
(9)
The concept of entropy was introduced by Chen et al. in 2014 [51], and is defined as
(10)
The remaining entropies were found in [52], which are defined as
First redefined Zagreb entropy: if
Then
(11)
Now, by using (11) in (10), the first redefined Zagreb entropy is
(12)
Second redefined Zagreb entropy: if
Then
(13)
Now, by using (13) in (10), the second redefined Zagreb entropy is
(14)
Third redefined Zagreb entropy: if
Then
(15)
Now, by using (15) in (10), the third redefined Zagreb entropy is
(16)
3. -Polynomial and Topological Indices for Zero-Divisor Graph
Let be a modular ring with unity and be the product of two modular rings. A non-zero element z of a modular ring is said to be a zero divisor if there exists another non-zero element y of such that the product of z and y will be zero under the modulo n. In other words, two non-zero elements will be zero divisors to each other if their product will be zero. Similarly, two non-zero elements , from will be zero, divisors to each other if the product of both will be zero such that under modulo . In this section, polynomial and topological indices for the zero-divisor graph with numerically and graphically behavior are discussed. The zero-divisor graph as shown in Figure 2.
Let be a zero-divisor graph over with distinct primes (), then M-polynomial is
(17)
Let be a zero-divisor graph over with distinct primes (). The cardinality function of edge partition for is;
(18)
By Equation (6);
Substituting the value from (18) in above equation, we then have
This one is a desired relation (17). □
Let be a zero-divisor graph over with distinct primes (); then
(19)
(20)
(21)
(22)
(23)
Let be a zero-divisor graph over with distinct primes (). First, we will find the following terms: , , , , and by using the -polynomial from Equation (17). Let ; then
(24)
(25)
(26)
(27)
(28)
(29)
(30)
By adding Equations (24) and (25), then substituting .
(31)
By substituting in Equation (26);
(32)
By substituting in Equation (29);
(33)
By substituting in Equation (27);
(34)
By substituting in Equation (30);
(35)
□The numerical and graphical comparisons of , , , , and over zero-divisor graphs are given in Table 2 and Figure 3, respectively.
Let be a zero-divisor graph over with distinct primes (); then
(36)
(37)
(38)
(39)
(40)
Let be a zero-divisor graph over with distinct primes (). By adding (24) and (25);
(41)
Differentiating with respect to y of Equation (41);
(42)
Differentiating with respect to y of Equation (42);
(43)
By substituting in Equation (43) the third symmetric division index becomes;
(44)
After some more simplification, we have
(45)
By applying on Equation (28);
(46)
Similarly;
(47)
Adding Equations (46) and (47);
(48)
By substituting in Equation (48) the fifth symmetric division index becomes;
(49)
After some more simplification, we have the desired result.
For the harmonic index, we will first find the value of J;
(50)
Applying on (50), we have
(51)
The harmonic index is,
(52)
For the inverse sum index, firsy applying J on (26);
(53)
Applying on (53), we have
The inverse sum index is,
(54)
For the forgotten topological index, we will first compute and . Applying on (24);
(55)
(56)
By adding Equations (55) and (56).
(57)
The forgotten topological index is,
(58)
□
The numerical and graphical comparisons of , , , , , and over zero-divisor graphs are given in Table 3 and Figure 4, respectively.
4. -Polynomial and Topological Indices for Zero-Divisor Graph
In this section, polynomial and topological indices for zero-divisor graph with numerically and graphically behavior are discussed. The zero-divisor graph as shown in Figure 5.
Let be a zero-divisor graph over with distinct primes (), then M-polynomial is
(59)
Let be a zero-divisor graph over with distinct primes (). The cardinality function of edge partition for is;
(60)
By using Equation (6),
Using the data from Equation (60), we have
This one is a desired relation (59). □
Let be a zero-divisor graph over with distinct primes (), then
(61)
(62)
(63)
(64)
(65)
Let be a zero-divisor graph over with distinct primes (), then
(66)
(67)
(68)
(69)
(70)
The numerically and graphically comparison of , , , and over zero-divisor graphs is given in Table 4 and Figure 6, respectively.
5. Entropies for the Zero-Divisor Graphs
In this section, three kind of entropies—namely the first, second, and third redefined Zagreb entropies—are founded over zero-divisor graphs .
Let be a zero-divisor graph over with distinct primes (); then
(71)
(72)
(73)
(74)
(75)
(76)
□Let be a zero-divisor graph over with distinct primes (); then
(77)
(78)
(79)
6. Conclusions
The mathematical framework used to analyze graphs and their characteristics using algebraic structures and techniques is known as algebraic graph theory. It enables researchers to conduct more systematic and rigorous graph analysis, allowing them to discover correlations between graph attributes and comprehend how different symmetries and structural aspects of molecules and crystals impact their behavior. Entropy is a notion adopted from information theory and statistical mechanics in graph theory. It quantifies the degree of uncertainty or unpredictability associated with a graph or a particular attribute of a graph. We have investigated several topological indices, namely first Zagreb, second Zagreb, second modified Zagreb, general Randic, inverse general Randic, third symmetric division, fifth symmetric division, harmonic, inverse sum, and forgotten topological by means of -polynomial for certain families.
For , from Table 2 and Figure 3, we conclude that
From Table 3 and Figure 4, we conclude that
From Table 4 and Figure 6, we conclude that
Further, different kinds of entropies such as the first, second, and third redefined Zagreb are investigated over proposed families of graphs. In future work, if anyone can generalize this study for each zero-divisor graph, then this result is very interesting for researchers working in the area of algebraic graph theory.
The material is the result of the joint efforts of A.S.A., S.A., N.H., A.M.M., Y.S. and A.A. All authors have read and agreed to the published version of the manuscript.
No data were used to support this study.
The authors extend their appreciation to Princess Nourah bint Abdulrahman University for funding this research under Researchers Supporting Project number (PNURSP2023R231), Princess Nourah bint Abdulrahman University, Riyadh, Saudi Arabia.
The authors declare no conflict of interest.
Footnotes
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.
Figure 3. The three-dimensional discrete plot of first Zagreb, second Zagreb, second modified Zagreb, general Randic, and Inverse general Randic index for [Forumla omitted. See PDF.].
Figure 4. The three-dimensional discrete plot of third symmetric division, fifth symmetric division, harmonic, inverse sum and forgotten topological index for [Forumla omitted. See PDF.].
Figure 6. Three-dimensional discrete plot of third symmetric division, fifth symmetric division, harmonic, inverse sum, and forgotten topological index for [Forumla omitted. See PDF.].
Relation between
Topological Indices |
|
|
---|---|---|
|
|
|
Where,
Numerical comparison between topological indices, namely,
|
|
|
|
|
|
|
---|---|---|---|---|---|---|
3 | 2 | 110 | 160 | 1.375 | 160 | 1.375 |
5 | 3 | 2036 | 7094 | 1.50986 | 7094 | 1.50986 |
7 | 5 | 17,286 | 115,119 | 1.6312 | 115,119 | 1.6312 |
11 | 7 | 152,610 |
|
1.73133 |
|
1.73133 |
13 | 11 | 553,692 |
|
1.78802 |
|
1.78802 |
17 | 13 |
|
|
1.8267 |
|
1.8267 |
19 | 17 |
|
|
1.85117 |
|
1.85117 |
23 | 19 |
|
|
1.87162 |
|
1.87162 |
29 | 23 |
|
|
|
|
1.89494 |
31 | 29 |
|
|
1.90672 |
|
1.90672 |
37 | 31 |
|
|
1.91809 |
|
1.91809 |
Numerical comparison between topological indices, namely,
|
|
|
|
|
|
|
---|---|---|---|---|---|---|
3 | 2 | 1520 | 65.75 | 3.25 | 18 | 662 |
5 | 3 | 196,924 | 628.282 | 7.7356 | 278.188 | 37,108 |
7 | 5 |
|
2929.59 | 14.8933 | 2068.22 | 665,862 |
11 | 7 |
|
18,036.5 | 25.8092 | 13,522.3 |
|
13 | 11 |
|
43,719.1 | 37.5964 | 44,500.5 |
|
17 | 13 |
|
121,383 | 49.21 | 120,432 |
|
19 | 17 |
|
216,988 | 61.0129 | 245,611 |
|
23 | 19 |
|
441,448 | 72.843 | 485,667 |
|
29 | 23 |
|
|
92.6126 |
|
|
31 | 29 |
|
|
108.471 |
|
|
37 | 31 |
|
|
124.42 |
|
|
Numerically comparison between topological indices namely
|
|
|
|
|
|
|
---|---|---|---|---|---|---|
3 | 2 | 125,552 | 683.877 | 6.53385 | 195.608 | 27,608 |
5 | 3 |
|
16,629.1 | 18.9935 | 5022.67 |
|
7 | 5 |
|
147,929 | 43.326 | 54,329.2 |
|
11 | 7 |
|
|
98.3333 | 652,906 |
|
13 | 11 |
|
|
163.917 |
|
|
17 | 13 |
|
|
260.899 |
|
|
19 | 17 |
|
|
356.206 |
|
|
23 | 19 |
|
|
495.172 |
|
|
29 | 23 |
|
|
763.816 |
|
|
31 | 29 |
|
|
956.485 |
|
|
37 | 31 |
|
|
1276.08 |
|
|
References
1. Zahid, M.A.; Naeem, M.; Baig, A.Q.; Ggao, W. General fifth M-Zagreb indices and fifth M-Zagreb polynomials of crystal cubic carbon. Util. Math.; 2018; 109, 929.
2. Cotton, F.A.; Wilkinson, G.; Murillo, C.A.; Bochmann, M. Advanced Inorganic Chemistry; John Wiley and Sons Inc.: Hoboken, NJ, USA, 1999.
3. Deng, H.; Yang, J.; Xia, F. A general modeling of some vertex-degree based topological indices in benzenoid systems and phenylenes. Comput. Math. Appl.; 2011; 61, pp. 3017-3023. [DOI: https://dx.doi.org/10.1016/j.camwa.2011.03.089]
4. Gao, W.; Wang, Y.; Basavanagoud, B.; Jamil, M.K. Characteristics studies of molecular structures in drugs. Saudi Pharm. J.; 2017; 25, pp. 580-586. [DOI: https://dx.doi.org/10.1016/j.jsps.2017.04.027] [PubMed: https://www.ncbi.nlm.nih.gov/pubmed/28579895]
5. Gayathri, P.; Priyanka, U.; Priyanka, U. Degree based topological indices of zig zag chain. J. Math. Inform.; 2017; 11, pp. 83-93. [DOI: https://dx.doi.org/10.22457/jmi.v11a11]
6. Gutman, I. Some properties of the Wiener polynomial. Graph Theory Notes N. Y.; 1993; 125, pp. 13-18.
7. Kier, L.B.; Hall, L.H. Molecular Connectivity in Structure-Activity Analysis; John Wiley and Sons: New York, NY, USA, 1986.
8. Li, X.; Shi, Y. A survey on the Randic index. MATCH Commun. Math. Comput. Chem.; 2008; 59, pp. 127-156.
9. Alaeiyan, M.; Natarajan, C.; Sathiamoorthy, G.; Farahani, M.R. The eccentric connectivity index of polycyclic aromatic hydrocarbons (PAHs). Eurasian Chem. Commun.; 2020; 2, pp. 646-651. [DOI: https://dx.doi.org/10.33945/SAMI/ECC.2020.6.1]
10. Khalaf, A.; Jalil, M.; Hussain, S.; Afzal, D.; Afzal, F.; Maqbool, A. M-polynomial and topological indices of book graph. J. Discret. Math. Sci. Cryptogr.; 2020; 23, pp. 1217-1237. [DOI: https://dx.doi.org/10.1080/09720529.2020.1809115]
11. Cancan, M.; Ediz, S.; Farahani, M.R. On ve-degree atom-bond connectivity, sum-connectivity, geometric-arithmetic and harmonic indices of copper oxide. Eurasian Chem. Commun.; 2020; 2, pp. 641-645. [DOI: https://dx.doi.org/10.33945/SAMI/ECC.2020.5.11]
12. Imran, M.S.A.; Bokhary, U.H.; Manzoor, S.; Siddiqui, M.K. On molecular topological descriptors of certain families of nanostar dendrimers. Eurasian Chem. Commun.; 2020; 2, pp. 680-687. [DOI: https://dx.doi.org/10.33945/SAMI/ECC.2020.6.5]
13. Farahani, M.R. Some connectivity indices and Zagreb index of polyhex nanotubes. Acta Chim. Slov.; 2012; 59, pp. 779-783.
14. Randic, M. Characterization of molecular branching. J. Am. Chem. Soc.; 1975; 97, pp. 6609-6615. [DOI: https://dx.doi.org/10.1021/ja00856a001]
15. Zhou, B.; Gutman, I. Relations between Wiener, hyper-Wiener and Zagreb indices. Chem. Phys. Lett.; 2004; 394, pp. 93-95. [DOI: https://dx.doi.org/10.1016/j.cplett.2004.06.117]
16. Ahmad, Z.; Naseem, M.; Naseem, M.; Jamil, M.K.; Nadeem, M.F.; Wang, S. Eccentric connectivity indices of titania nanotubes TiO2[m;n]. Eurasian Chem. Commun.; 2020; 2, pp. 712-721. [DOI: https://dx.doi.org/10.33945/SAMI/ECC.2020.6.8]
17. Ahmad, Z.; Naseem, M.; Naseem, M.; Jamil, M.K.; Siddiqui, M.K.; Nadeem, M.F. New results on eccentric connectivity indices of V-Phenylenic nanotube. Eurasian Chem. Commun.; 2020; 2, pp. 663-671. [DOI: https://dx.doi.org/10.33945/SAMI/ECC.2020.6.3]
18. Babujee, J.B.; Ramakrishnan, S. Topological indices and new graph structures. Appl. Math. Sci.; 2012; 6, pp. 5383-5401.
19. Deutsch, E.; Klavar, S. M-polynomial and degree-based topological indices. Iran. J. Math.; 2015; 6, 93102.
20. Dobrynin, A.A.; Entringer, R.; Gutman, I. Wiener index of trees: Theory and applications. Acta Appl. Math.; 2001; 66, pp. 211-249. [DOI: https://dx.doi.org/10.1023/A:1010767517079]
21. Dimitrov, D. On structural properties of trees with minimal atom-bond connectivity index IV: Solving a conjecture about the pendent paths of length three. Appl. Math. Comput.; 2017; 313, pp. 418-430. [DOI: https://dx.doi.org/10.1016/j.amc.2017.06.014]
22. Chaudhry, F.; Shoukat, I.; Afzal, D.; Park, C.; Cancan, M.; Farahani, M.R. M-polynomials and degree-based topological indices of the molecule copper(I) oxide. J. Chem.; 2021; 2021, 6679819. [DOI: https://dx.doi.org/10.1155/2021/6679819]
23. Shannon, C.E. A mathematical theory of communication. Bell Syst. Tech. J.; 1948; 27, pp. 379-423. [DOI: https://dx.doi.org/10.1002/j.1538-7305.1948.tb01338.x]
24. Goldsmith, B.; Salce, L. Algebraic entropies for Abelian groups with applications to the structure of their endomorphism rings: A survey. Groups, Modules, and Model Theory—Surveys and Recent Developments; Droste, M.; Fuchs, L.; Goldsmith, B.; Strüngmann, L. Springer: Cham, Switzerland, 2017; pp. 135-174. [DOI: https://dx.doi.org/10.1007/978-3-319-51718-6_7]
25. Huang, W.; Zhang, Y.; Yu, Y.; Xu, Y.; Xu, M.; Zhang, R.; Dieu, G.J.D.; Yin, D.; Liu, Z. Historical data-driven risk assessment of railway dangerous goods transportation system: Comparisons between Entropy Weight Method and Scatter Degree Method. Reliab. Eng. Syst. Saf.; 2021; 205, 107236. [DOI: https://dx.doi.org/10.1016/j.ress.2020.107236]
26. Julietraja, K.; Venugopal, P.; Prabhu, S.; Arulmozhi, A.K.; Siddiqui, M.K. Structural analysis of three types of PAHs using entropy measures. Polycycl. Aromat. Compd.; 2022; 42, pp. 4101-4131. [DOI: https://dx.doi.org/10.1080/10406638.2021.1884101]
27. Nie, C.-X.; Fu, S. Entropy of graphs in financial markets. Comput. Econ.; 2021; 57, pp. 1149-1166. [DOI: https://dx.doi.org/10.1007/s10614-020-10007-3]
28. Das, K.C.; Ali, A. On a conjecture about the second Zagreb index. Discret. Math. Lett.; 2019; 2, pp. 38-43.
29. Das, K.C.; Shang, Y. Some extremal graphs with respect to Sombor index. Mathematics; 2021; 9, 1202. [DOI: https://dx.doi.org/10.3390/math9111202]
30. Das, K.C.; Ghalavand, A.; Ashrafi, A.R. On a conjecture about the Sombor index of graphs. Symmetry; 2021; 13, 1830. [DOI: https://dx.doi.org/10.3390/sym13101830]
31. Das, K.C.; Levik, A.S.; Cangul, I.N.; Shang, Y. On sombor index. Symmetry; 2021; 13, 140. [DOI: https://dx.doi.org/10.3390/sym13010140]
32. Das, K.C.; Dehmer, M. A conjecture regarding the extremal values of graph entropy based on degree powers. Entropy; 2016; 18, 183. [DOI: https://dx.doi.org/10.3390/e18050183]
33. Mondal, S.; Das, K.C. Degree-Based Graph Entropy in Structure Property Modeling. Entropy; 2023; 25, 1092. [DOI: https://dx.doi.org/10.3390/e25071092]
34. Livingston, P.S. Structure in Zero-Divisor Graphs of Commutative Rings. Master’s Thesis; University of Tennessee: Knoxville, TN, USA, 1997.
35. Mahmood, M.K.; Ali, S. A novel labeling algorithm on several classes of graphs. Punjab Univ. J. Math.; 2017; 49, pp. 23-35.
36. Shahbaz, A.; Mahmood, K. New Numbers on Euler’s Totient Function with Applications. J. Math. Ext.; 2019; 14, pp. 61-83.
37. Shahbaz, A.; Mahmood, M.K. A paradigmatic approach to investigate restricted totient graphs and their indices. Comput. Sci.; 2021; 16, pp. 793-801.
38. Shahbaz, A.; Mahmood, M.K.; Shum, K.P. Novel classes of integers and their applications in graph labeling. Hacettepe J. Math. Stat.; 2021; 5, pp. 1-17.
39. Shahbaz, A.; Mahmmod, M.K.; Ganfornina, R.M.F. A paradigmatic approach to investigate restricted hyper totient graphs. AIMS Math.; 2021; 6, pp. 3761-3771.
40. Mahmood, M.K.; Ali, S. On super totient numbers, with applications and algorithms to graph labeling. Ars Comb.; 2019; 143, pp. 29-37.
41. Brockler, F.M.; Doglic, T.; Graovac, A.; Gutman, I. On a class of distance-based molecular structure descriptors. Chem. Phys. Lett.; 2011; 503, pp. 336-338. [DOI: https://dx.doi.org/10.1016/j.cplett.2011.01.033]
42. Ekimov, E.A.; Sidorov, V.A.; Bauer, E.D.; Mel’Nik, N.N.; Curro, N.J.; Thompson, J.D.; Stishov, S.M. Superconductivity in diamond. Nature; 2004; 428, pp. 542-545. [DOI: https://dx.doi.org/10.1038/nature02449]
43. Afzal, F.; Hussain, S.; Afzal, D.; Razaq, S. Some new degree based topological indices via M-polynomial. J. Inf. Optim. Sci.; 2020; 41, pp. 1061-1076. [DOI: https://dx.doi.org/10.1080/02522667.2020.1744307]
44. Gao, W.; Iqbal, Z.; Ishaq, M.; Sarfraz, R.; Aamir, M.; Aslam, A. On eccentricity-based topological indices study of a class of porphyrin-cored dendrimers. Biomolecules; 2018; 8, 71. [DOI: https://dx.doi.org/10.3390/biom8030071]
45. Gao, W.; Wu, H.; Siddiqui, M.K.; Baig, A.Q. Study of biological networks using graph theory. Saudi J. Biol. Sci.; 2018; 25, pp. 1212-1219. [DOI: https://dx.doi.org/10.1016/j.sjbs.2017.11.022] [PubMed: https://www.ncbi.nlm.nih.gov/pubmed/30174525]
46. Hu, Y.; Li, X.; Shi, Y.; Xu, T.; Gutman, I. On molecular graphs with smallest and greatest zeroth-order general Randic index. MATCH Commun. Math. Comput. Chem.; 2005; 54, pp. 425-434.
47. Yang, H.; Zhang, X. The independent domination numbers of strong product of two cycles. J. Discret. Math. Sci. Cryptogr.; 2018; 21, pp. 1495-1507. [DOI: https://dx.doi.org/10.1080/09720529.2017.1316988]
48. Ivanciuc, O. Chemical graphs, molecular matrices and topological indices in chemoinformatics and quantitative structure-activity relationships. Curr.-Comput.-Aided Drug Des.; 2013; 9, pp. 153-163. [DOI: https://dx.doi.org/10.2174/1573409911309020002]
49. Kang, S.M.; Zahid, M.A.; Virk, A.U.R.; Nazeer, W.; Gao, W. Calculating the degree-based topological indices of dendrimers. Open Chem.; 2018; 16, pp. 681-688. [DOI: https://dx.doi.org/10.1515/chem-2018-0071]
50. Ranjini, P.S.; Lokesha, V.; Usha, A. Relation between phenylene and hexagonal squeeze using harmonic index. Int. J. Graph Theory; 2013; 1, pp. 116-121.
51. Chen, Z.; Dehmer, M.; Shi, Y. A note on distance-based graph entropies. Entropy; 2014; 16, pp. 5416-5427. [DOI: https://dx.doi.org/10.3390/e16105416]
52. Manzoor, S.; Siddiqui, M.K.; Ahmad, S. On entropy measures of molecular graphs using topological indices. Arab. J. Chem.; 2020; 13, pp. 6285-6298. [DOI: https://dx.doi.org/10.1016/j.arabjc.2020.05.021]
You have requested "on-the-fly" machine translation of selected content from our databases. This functionality is provided solely for your convenience and is in no way intended to replace human translation. Show full disclaimer
Neither ProQuest nor its licensors make any representations or warranties with respect to the translations. The translations are automatically generated "AS IS" and "AS AVAILABLE" and are not retained in our systems. PROQUEST AND ITS LICENSORS SPECIFICALLY DISCLAIM ANY AND ALL EXPRESS OR IMPLIED WARRANTIES, INCLUDING WITHOUT LIMITATION, ANY WARRANTIES FOR AVAILABILITY, ACCURACY, TIMELINESS, COMPLETENESS, NON-INFRINGMENT, MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE. Your use of the translations is subject to all use restrictions contained in your Electronic Products License Agreement and by using the translation functionality you agree to forgo any and all claims against ProQuest or its licensors for your use of the translation functionality and any output derived there from. Hide full disclaimer
© 2023 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/). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
Abstract
The field of mathematics that studies the relationship between algebraic structures and graphs is known as algebraic graph theory. It incorporates concepts from graph theory, which examines the characteristics and topology of graphs, with those from abstract algebra, which deals with algebraic structures such as groups, rings, and fields. If the vertex set of a graph
You have requested "on-the-fly" machine translation of selected content from our databases. This functionality is provided solely for your convenience and is in no way intended to replace human translation. Show full disclaimer
Neither ProQuest nor its licensors make any representations or warranties with respect to the translations. The translations are automatically generated "AS IS" and "AS AVAILABLE" and are not retained in our systems. PROQUEST AND ITS LICENSORS SPECIFICALLY DISCLAIM ANY AND ALL EXPRESS OR IMPLIED WARRANTIES, INCLUDING WITHOUT LIMITATION, ANY WARRANTIES FOR AVAILABILITY, ACCURACY, TIMELINESS, COMPLETENESS, NON-INFRINGMENT, MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE. Your use of the translations is subject to all use restrictions contained in your Electronic Products License Agreement and by using the translation functionality you agree to forgo any and all claims against ProQuest or its licensors for your use of the translation functionality and any output derived there from. Hide full disclaimer
Details




1 Department of Mathematical Sciences, College of Science, Princess Nourah bint Abdulrahman University, P.O. Box 84428, Riyadh 11671, Saudi Arabia
2 Department of Mathematics, The Islamia University of Bahawalpur, Rahim Yar Kahn Campus, Rahim Yar Khan 64200, Pakistan
3 Department of Mathematics, College of Science, Jazan University, Jazan 45142, Saudi Arabia
4 Department of Computer and Information Sciences, Northumbria University, Newcastle NE1 8ST, UK
5 Department of Mathematical Sciences, College of Applied Science, Umm Alqura University, Makkah 21955, Saudi Arabia