Abstract
Chemical graph theory is a well-established discipline within chemistry that employs discrete mathematics to represent the physical and biological characteristics of chemical substances. In the realm of chemical compounds, graph theory-based topological indices are commonly employed to depict their geometric structure. The main aim of this paper is to investigate the degree-based topological indices of dominating David derived networks (DDDN) and assess their effectiveness. DDDNs are widely used in analyzing the structural and functional characteristics of complex networks in various fields such as biology, social sciences, and computer science. We considered the FN*, \({M}_{2}^{*}\), and \({HM}_{N}\) topological indices for DDDNs. Our computations' findings provide a clear understanding of the topology of networks that have received limited study. These computed indices exhibit a high level of accuracy when applied to the investigation of QSPRs and QSARs, as they demonstrate the strongest correlation with the acentric factor and entropy.
Similar content being viewed by others
Introduction
In the field of graph theory, specifically in chemical graph theory, a chemical molecule is represented by a molecular graph, which is a simple graph. In this representation, vertices denote the atoms and edges represent bonds or connections. The edges goes beyond simple connectivity; it encompasses the type of bond as well. For instance, a single edge might denote a single covalent bond, while a double edge could represent a double bond involving the sharing of two pairs of electrons.
The emerging field of cheminformatics, which explores the relationship between quantitative structure–activity and structure–property, is gaining momentum as it aids in the prediction of biological activities. Topological indices are important invariants derived from graph theory that enable the characterization of a graph's topology. A topological index is a numerical value that provides information about the structure of a graph. Topological indices help in identifying various characteristics of a graph. Furthermore, the topology of a graph remains invariant under the automorphisms of graphs. Comperisons of the degree based toplogical indices hold a particularly significant place in research1, 2.
The first toplogical index introduced by Wiener, during the research of paraffin melting point. Initially termed “path number”, it was later renamed and has since become known as the Wiener index. Researchers have put a lot of effort into studying chemical graph theory. A key component of graph theory's work involves honeycomb networks. The honeycomb shape, with its hexagonal pattern of cells, finds a wide range of applications across various fields due to its unique structural and geometric properties. Some of the notable applications of the honeycomb shape include as: In structural engineering and architecture the honeycomb structure's hexagonal arrangement provides exceptional strength and stability while using minimal material. This makes it suitable for applications in construction, such as in lightweight yet strong support structures, building facades, and panels. On the other hands, in art and design, the visually appealing hexagonal pattern of the honeycomb has inspired artists, designers, and architects to incorporate it into their creations. From decorative elements in interior design to art installations, the honeycomb pattern adds a unique aesthetic.
In this article the notation E denotes an edge set and V denotes the vertex set of a graph G. The expression \(\eta_{G} \left( v \right)\) is the number of edges overall connected to a particular vertex v.
For the sake of simplicity, assume that a and b are two adjacent vertices and E is an edge between them, then the edge partition of E is denoted by \({E}_{a,b}\) and formulated as \(E_{a,b} = \{ \eta_{G} (a)\,,\,\,\eta_{G} (b)\}\).
The degree-based topological indices shows a significant role in the field of mathematical chemistry3,4,5,6,7, and widely used to develop models that accurately predict the boiling points of alkanes with carbon atom8. Some current discovered degree-based neighborhood indices are presented in9, 10 and shown strong connections between entropy and the acentric factor.
In11,12,13,14,15,16, different chemical significant graphs' topological indices are considered. Baig et al.17 considered the topological indices for several silicates and oxide networks. Ullah et al.18, compared and examined the computational characteristics of two carbon nanosheets using some innovative topological indices. The topological characteristics of rhombus-type silicate and oxide networks were explored by Javaid et al.19. Recently, Koam et al.20, established the entropy measures of Y-junction based nanostructures. Ali et al.21 give some properties of ve-degree based topological indices for hex-derived networks. In this study, an examination was conducted on distance-based topological polynomials that are associated with zero-divisor graphs, as discussed in22. The authors of23 obtained the polynomials of degree-based indices of metal–organic networks. Zaman et al., determined the kemeny’s constant and spanning trees of hexagonal ring network24. Some upper bound and lower bound of graphs and also the spectral analysis of graphs are discussed in25,26,27,28. In this research, inspired by earlier studies, we establish some exact expressions of the different types of Dominating David derived networks and their comparisons.
We have calculated the forgotten index (\(F_{N}^{ * }\))29, the second zargeb index (\(M_{2}^{ * }\))30 and the Harmonic index (\({HM}_{N}\))31 for DDD networks. These topological indices are defined as \(F_{N}^{ * } = \sum\limits_{uv \in E\left( G \right)} {\left[ {\eta_{G} \left( u \right)^{2} + \eta_{G} \left( v \right)^{2} } \right]}\), \(HM_{N} \left( G \right) = \sum\limits_{uv \in E\left( G \right)} {\left[ {\eta_{G} \left( u \right) + \eta_{G} \left( v \right)} \right]}^{2}\), \(M_{2}^{ * } = \sum\limits_{uv \in E\left( G \right)} {\left[ {\eta_{G} \left( u \right) + \eta_{G} \left( v \right)} \right]}\).
Constructions of dominating David derived networks (DDDN)
In the field of chemistry, honeycomb networks are utilized as representations for benzoid hydrocarbons. Honeycomb networks find extensive applications in various domains, including graphics, such as cell phone base stations and image processing. The honeycomb network is formed by enclosing the boundaries with a layer of hexagons. Based on the honeycomb network, different types of Dominating David derived networks can be derived. One can follow the below steps to construct the DDDN (t dimension):
- Step 1::
-
Consider a t-dimension honeycomb network (see Fig. 1a).
- Step 2::
-
Add another vertex to divide each edge into two pieces (see Fig. 1b).
- Step 3::
-
In each hexagonal cell, connect the new vertices by an edge if they are at a distance of 4 within a hexagon (see Fig. 1c).
- Step 4::
-
Add new vertices at new edge intersections. (see Fig. 1d).
- Step 5::
-
Remove the starting vertices and edges of the honeycomb (see Fig. 1e).
- Step 6::
-
Divide each horizontal edge into two parts by addind a new vertex (see Fig. 1f).
Main results
Our key findings rely on the edge partitions of Figs. 2, 3 and 4 as given below. We have calculated these edge partitions based on the degrees of the end vertices of each edge. For instance, the first row of Fig. 1 shows the degrees of the end vertices of edges, while the second row illustrates the count of edges with those specific degrees. In the same way, we have obtained the other tables.
The FN * topological index for dominating David derived networks
Let G be a graph in D1(t), D2(t) and D3(t) then according to the definition of \(F_{N}^{ * }\) and Table 1, we have
Similarly, from Table 2, we have
And from Table 3, one has
The \({{\varvec{M}}}_{2}^{\boldsymbol{*}}\) topological index for DDDN
Let G be a graph in D1(t), D2(t) and D3(t) then according to the definition of \({M}_{2}^{*}\) and Table 1 we have
Likewise, based on the information presented in Table 2, we obtain
And from Table 3, one has
The \({{\varvec{H}}{\varvec{M}}}_{{\varvec{N}}}\) topological index for DDDN
Let G be a graph in D1(t), D2(t) and D3(t) then according to the definition of \({HM}_{N}\) and Table 1, we have
\(\begin{aligned} & HM_{N} \left( G \right) = 64t + 100t - 100 + 1008t - 576 + 324t^{2} - 468t + 180 + 1764t^{2} - 2744t + 1176 + 2304t^{2} - 3328t + 1280 \\ & HM_{N} \left( G \right) = 4392t^{2} - 5362t + 3240 \\ \end{aligned}\)Similarly, from Table 2, we have
And from Table 3, we have
Concluding Remarks
In this study, we have considered the \({F}_{N}^{*}\), \({M}_{2}^{*}\) and \(HM_{N}\) topological indices. Our simulated results help for the better comprehend topology and enhance physical properties of the honeycomb structure. The computed indices, and above, as previously mentioned, have the most closely relates to the acentric factor and entropy consequently, they are extremely accurate in QSPR and QSAR analysis.
In Table 4, the topological indices computed are represented mathematically. As we can see, increasing the values of t, increases the value of the indices as well. We have precise analytical formulations for the D1, D2 and D3 networks, considering various topological indices. In the rapidly expanding fields of nanotechnology and applications, such as networks, our current discoveries and techniques can be applied to other, more complex structures. The utilization of distance-based topological indices poses greater challenges and complexity, but they can be employed alongside existing methods. Exploring these types of studies will be the focus of future research endeavors. In Table 4 and Fig. 5, we computed the numerical comparison of the certain topological indices for D1, D2 and D3 networks, which shows that when we increase t as a result the values of the topological indices also increases. These numerical comaprisons also shows that the inceasing rate of \(HM_{N}\) for D3 is greater than the other topological indices. Since, in graph theory, the \(HM_{N}\) is a mathematical concept used to describe the connectivity. Therefore, a higher \(HM_{N}\) reflects the more connectivity among the atoms of a molecule. This indicates that the D3 molecule has a greater potential for forming diverse interactions with other molecules and participating in a wider range of chemical reactions.
Data availability
All data generated or analysed during this study are included in this published article.
References
Zaman, S. et al. Mathematical analysis and molecular descriptors of two novel metal–organic models with chemical applications. Sci. Rep. 13(1), 5314 (2023).
Liu, H. Comparison between Merrifield–Simmons index and some vertex-degree-based topological indices. Comput. Appl. Math. 42(2), 89 (2023).
Babar, U. et al. Multiplicative topological properties of graphs derived from honeycomb structure. Aims Math. 5(2), 1562–1587 (2020).
Ali, H. et al. On the degree-based topological indices of some derived networks. Mathematics 7(7), 612 (2019).
Yang, S. et al. Structure of Fejes Tóth cells in natural honey bee combs. Apidologie 53(1), 6 (2022).
Hayat, S., Malik, M. A. & Imran, M. Computing topological indices of honeycomb derived networks. Rom. J. Inf. Sci. Technol. 18(2), 144–165 (2015).
Imran, M. et al. On topological properties of poly honeycomb networks. Period. Math. Hung. 73, 100–119 (2016).
Mukwembi, S. & Nyabadza, F. A new model for predicting boiling points of alkanes. Sci. Rep. 11(1), 24261 (2021).
Ahmad, M. S. et al. Calculating degree-based topological indices of dominating David derived networks. Open Phys. 15(1), 1015–1021 (2017).
Imran, M., Baig, A. Q. & Ali, H. On topological properties of dominating David derived networks. Can. J. Chem. 94(2), 137–148 (2016).
Aslam, A. et al. On topological indices of certain dendrimer structures. Z. Naturforsch. A 72(6), 559–566 (2017).
Ullah, A., Zeb, A. & Zaman, S. A new perspective on the modeling and topological characterization of H-naphtalenic nanosheets with applications. J. Mol. Model. 28(8), 1–13 (2022).
Wang, G. et al. The connective eccentricity index of graphs and its applications to octane isomers and benzenoid hydrocarbons. Int. J. Quantum Chem. 120(18), e26334 (2020).
Mondal, S., De, N. & Pal, A. Topological properties of graphene using some novel neighborhood degree-based topological indices. Int. J. Math. Ind. 11(01), 1950006 (2019).
De, N. et al. On some degree based topological indices of mk-graph. J. Discrete Math. Sci. Cryptogr. 23(6), 1183–1194 (2020).
Zaman, S. & Ali, A. On connected graphs having the maximum connective eccentricity index. J. Appl. Math. Comput. 67(1), 131–142 (2021).
Baig, A. Q., Imran, M. & Ali, H. On topological indices of poly oxide, poly silicate, DOX, and DSL networks. Can. J. Chem. 93(7), 730–739 (2015).
Ullah, A. et al. Computational and comparative aspects of two carbon nanosheets with respect to some novel topological indices. Ain Shams Eng. J. 13(4), 101672 (2022).
Javaid, M., Rehman, M. U. & Cao, J. Topological indices of rhombus type silicate and oxide networks. Can. J. Chem. 95(2), 134–143 (2017).
Koam, A. N. et al. Entropy measures of Y-junction based nanostructures. Ain Shams Eng. J. 2022, 10 (1913).
Ahmad, A. & Imran, M. J. C. Vertex-edge-degree-based topological properties for hex-derived networks. Complexity 2022, 1–13 (2022).
Ahmad, A. et al. Analysis of distance-based topological polynomials associated with zero-divisor graphs. Comput. Mater. Contin. 70(2), 2898–2904 (2022).
Ahmad, A. et al. Polynomials of degree-based indices of metal-organic networks. Comb. Chem. High Throughput Screen. 25(3), 510–518 (2022).
Zaman, S., et al., The Kemeny’s Constant and Spanning Trees of Hexagonal Ring Network.
Khabyah, A. A. et al. Minimum zagreb eccentricity indices of two-mode network with applications in boiling point and benzenoid hydrocarbons. Mathematics 10(9), 1393 (2022).
Zaman, S. et al. Maximum H-index of bipartite network with some given parameters. AIMS Math. 6(5), 5165–5175 (2021).
Zaman, S. Cacti with maximal general sum-connectivity index. J. Appl. Math. Comput. 65(1), 147–160 (2021).
Zaman, S. Spectral analysis of three invariants associated to random walks on rounded networks with 2 n-pentagons. Int. J. Comput. Math. 99(3), 465–485 (2022).
Gao, W. et al. Forgotten topological index of chemical structure in drugs. Saudi Pharm. J. 24(3), 258–264 (2016).
Khalifeh, M., Yousefi-Azari, H. & Ashrafi, A. R. The first and second zagreb indices of some graph operations. Discrete Appl. Math. 157(4), 804–811 (2009).
Zhong, L. The harmonic index for graphs. Appl. Math. Lett. 25(3), 561–566 (2012).
Author information
Authors and Affiliations
Contributions
All authors have made equal contributions to this paper at every stage, including conceptualization and the final drafting process. The manuscript has been approved by all authors and consent for publication has been granted.
Corresponding author
Ethics declarations
Competing interests
The authors declare no competing interests.
Additional information
Publisher's note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.
About this article
Cite this article
Zaman, S., Ahmed, W., Sakeena, A. et al. Mathematical modeling and topological graph description of dominating David derived networks based on edge partitions. Sci Rep 13, 15159 (2023). https://doi.org/10.1038/s41598-023-42340-6
Received:
Accepted:
Published:
DOI: https://doi.org/10.1038/s41598-023-42340-6
This article is cited by
Comments
By submitting a comment you agree to abide by our Terms and Community Guidelines. If you find something abusive or that does not comply with our terms or guidelines please flag it as inappropriate.