Abstract
A chemical graph is an illustration of a chemical compound’s structural formula, where the edges indicate covalent bonding and the vertices depict atoms. In the study of (molecular) graphs, Zagreb indices and their variations are the most studied and well-investigated invariants due to their chemical applicability. To probe and investigate the most promising lower and upper bound of the appropriate topological index for a graph family is a problem of primal significance in extremal graph theory. Deng et al. computed the closed-form formulas for the Zagreb indices and for four novel operations known as F-sum graphs, proposed by Eliasi and Taeri in “Discrete Appl. Math. (2009) 157.” Subsequently, Buragohain et al. derived the formulas for and of four sum graphs in the context of the direct product. In this article, we investigate F-sum graphs formed through four newly defined graph operations associated with the direct product and establish lower bounds and upper bounds on the first hyper-Zagreb index for these graphs. Finally, we validate our derived bounds by applying them to various examples, demonstrating the correctness and applicability of the results.
Keywords:
hyper Zagreb indices; extremal graph; molecular graph; direct product; graph operations; Cartesian product MSC:
05C09; 05C07; 05C35; 05C76; 05C90; 92E10
1. Introduction
Graph theory is a subject of fundamental significance in mathematics. Graphs are used to describe diverse problems of various contemporary fields in topological pictorial form. Graph theory found its origin in 1735 when Euler introduced the concept of the Eulerian circuit while providing a solution to the Königsberg bridges problem. Researchers of different disciplines, such as biology, computer science, and chemistry especially chemical graph theory have great attraction towards graph theory, due to its immense applications. In the recent past, chemical compounds have been studied extensively using graphs to represent the molecular structure of these compounds through their 2D lattice (molecular graph). The effective applications of chemical graph theory involve the association of physicochemical properties with chemical substances under study.
A topological abstraction of a molecule is called a molecular graph, which is always a simple graph in which the vertices portray the atoms while the edges symbolize the bonding between them. A topological invariant or index (TI) is a numerical parameter mathematically extracted from a molecular graph using graph parameters and is independent of the pictorial characterization or the labeling of a graph. Mathematical formulas of TIs involve degree, distance, the spectrum of adjacency matrix, and their combination. TIs help researchers working in mathematical chemistry, chemical graph theory, and cheminformatics to understand, develop, and design new chemical compounds in the context of their chemical, biological, and physical properties. Graph theory is a rapidly expanding field and offers a platform for mathematical modeling to develop prototype activity prediction models in drug discovery.
There are many applications of topological indices as implemented for creating chemical and other characteristics of molecules. In particular, researchers in the field of cheminformatics choose the appropriate and pertinent TIs in the analysis of QSPR/QSAR to conclude various characteristics such as melting and boiling point, density, toxicity, critical temperature, enthalpy of formation, surface area, and entropy of chemical compounds. Among the major classes of TIs, the frequently investigated and analyzed are the Zagreb indices, hyper-Zagreb indices, Wiener, Randić, Szeged, sum-connectivity, and atom-bond connectivity indices.
In 1947, Harry Wiener introduced the earliest known distance-related TI, called the Wiener index [1], and proved it to be a good estimator of the boiling point of alkanes. This milestone initiated a surge of interest in the development of various TIs, which later found significant applications in the design, analysis, and prediction of QSAR and QSPR. Among these, one of the most effective indices for predicting molecular branching in saturated hydrocarbons is the Randić connectivity index, proposed by Milan Randić in 1975 [2]. Another prominent class of classical degree-based topological indices includes the Zagreb indices, introduced by Gutman and Trinajstić in 1972 [3,4].
The equivalent mathematical formulation of based on the degree structural characteristics of a molecular graph is given by
Zhou and Trinajstić, initiated the idea of the general sum-connectivity index (GSCI) [5] and is given as follows:
Inspired by the wide range of applications of the Zagreb indices, for a molecular graph , V.R. Kulli (2017) introduced the concept of the 1st and 2nd Gourava index [6] and defined as follows:
Ranjini et al. (2013) introduced the idea of the third re-defined Zagreb index [7] and formulated it as follows:
Initially, Ranjini introduced the topological index , which was subsequently followed by Kulli’s definition of . Upon examination, it is evident that these two indices are equivalent, i.e., , highlighting the consistency between their respective formulations. In 2013, Shirdel et al. [8] proposed the first hyper-Zagreb index (FHZI), which is widely utilized in mathematical chemistry and cheminformatics to estimate thermodynamic, biological, and topological characteristics of organic compounds, polymers, and nanostructures. This index is defined as
Wang et al. [9] introduced the second hyper Zagreb index (2016) by integrating the degree products of adjacent vertices, which refines the classical Zagreb indices and provides a deeper insight into molecular structure. Its increased sensitivity to topological variations makes it a powerful tool for characterizing complex and branched molecular architectures. It is defined as follows:
Graph operations are essential tools for constructing new families of graphs, especially in the context of molecular structure modeling. Various established operations in graph theory enable the generation of complex and application-oriented graph structures. Some of the most widely used operations include the Cartesian , Strong , Lexicographic, Corona , and Direct products.
The Cartesian product of two graphs, denoted by , was originally introduced by Whitehead and Russell in 1912. This product is defined on the vertex set , where adjacency between two vertices and in holds if and only if either and , or and . The Cartesian product thus establishes a graph structure in which adjacency is inherited independently from each factor graph, preserving both local and global topological characteristics of the constituent graphs.
By applying certain unary graph operations to a given graph , one can obtain four well-known derived graphs as follows:
- Subdivision Graph: The graph undergoes expansion to create by introducing a new vertex to each edge of .
- Triangle parallel graph: is derived from by connecting solid vertices along the original edges of that are associated with hollow vertices.
- Line superposition graph: can be formed from by connecting pairs of new vertices with edges, where each pair shares an adjacent (solid) vertex.
- Total graph: is formed by simultaneously applying both and to .
An illustration of these derived graphs for the path graph is presented in Figure 1.
Figure 1.
Path and its four related graphs.
In the F-sum graph , where and are two simple, connected, and finite graphs, and F is an operation (chosen from S, R, Q, and T), the vertex set is defined as . Two vertices, and , in are adjacent if and only if: 1. and , or 2. and . In the graph , we note that there are copies of the graph , and each of these copies is labeled with vertices of . Specifically, in , vertices corresponding to the original vertices of G are called solid vertices, while those corresponding to the edges are termed hollow vertices. To improve clarity, the process involves connecting solid vertices within the same copy of , preserving their adjacency in . In other words, solid vertices with identical labels in are joined if they are adjacent in , see Figure 2.
Figure 2.
F-sum of with .
In [10], Paul M. Weichsel (1962) proposed the idea of Direct product for two graphs and represented by with the vertex set and the set of edges satisfying the condition and . The Direct product of with is described in Figure 3.
Figure 3.
Direct product of with .
F-sum graphs constitute a significant class of graph operations that integrate two graphs into a composite structure, providing an effective framework for modeling macromolecules, nanostructures, and polymeric systems. In this study, we employ the first hyper-Zagreb index as a representative topological invariant (TI), since it encapsulates the structural features of both the forgotten and second Zagreb indices, thereby reflecting the molecular connectivity, branching complexity, electron energy, and the influence of local structural variations on the overall molecular topology. To establish bounds for selected topological indices corresponding to molecular graphs generated through graph operations, we adopt a systematic methodology that integrates combinatorial reasoning with algebraic formulation. Specifically, F-sum graphs are constructed using the Cartesian product between four unary transformations of a base graph and a secondary graph . This framework can further be generalized through the use of other standard graph products, such as the Direct product.
The derivation of bounds on for F-sum graphs relies fundamentally on formulating and applying the degree relations between the composite and its constituent base graphs. These relations are subsequently simplified to express the bounds in terms of known indices and parameters of the original graphs. Finally, the theoretical results are validated through illustrative case studies involving small-scale molecular graph examples. Again, the distinction between the F-sum graphs under Direct product and the simple Direct product of with lies in replacing with , where F denotes one of the aforementioned four unary operations. The F-sum of with under the Direct product is presented in Figure 4.
Figure 4.
F-sum of with under Direct product.
In the graph, the order and size are and , respectively. For graphs and , it is easy to establish a degree relation between new graphs , where F is one of four unary operations S, R, Q, and T, and old (base) graphs that are presented below.
In expression (3) vertex is placed in edge .
In degree relation (4) the vertex is placed in the edge .
In 2009, Khalifeh et al. and Eliasi et al. [11,12] offered the formulas of the Zagreb indices for four new graphs related to the Cartesian product (F-sum) and derived their Wiener index, respectively. In 2012, Pattabiraman et al. [13] used different topological indices to find a relation with graphs involving the Direct product. In 2014, Mahdieh found the sharp lower bound of the Narumi–Katayama index for different graph operations [14]. In 2016, Deng et al. [15] discerned exact formulas for Zagreb indices working with four new operations (F-sum) of graphs. In 2017, Sarala et al., Basavanagoud et al., and Imran et al. [16,17,18] determined the Zagreb indices for four-sum graphs related to the lexicographic product, the first hyper-Zagreb index for four-sum graphs related to the Cartesian product, and bounds on various TIs of graphs under Direct product, respectively. In 2018, Elumalai et al. [19] demonstrated improved bounds for the first hyper-Zagreb index with respect to simple connected graphs. In 2020, for the first time, Buragohain et al. and Basavanagoud et al. [20,21] introduced F-sum operations by replacing the Cartesian product with the Direct product and calculated formulas for Zagreb indices and co-indices, respectively. The VL index proved to be a good predictor of some physicochemical properties of hydrocarbons, and in 2021 Deepika [22] investigated and offered bounds on the VL index for F-sum graphs under Direct product. In this paper, we aim to derive and analyze lower and upper bounds on the first hyper-Zagreb index for the latest introduced F-sum graphs under Direct product. Further, we will provide support to and check the accuracy of our bounds by elaborating them for several specific examples.
2. Results and Discussion
This section presents the main results, where explicit formulas and bounds for the first hyper-Zagreb index of F-sum graphs under the Direct product are derived. To streamline the notation throughout this discussion, we adopt the following conventions. Let and be two simple, connected, and finite graphs. Then we denote the following:
- , , = Smallest degree of , = Largest degree of .
- , , = Smallest degree of , = Largest degree of .
- , ,
- . ,
- , , , .
Theorem 1.
Let and be two connected, simple, and finite graphs, then the lower bound the upper bound of FHZI for graph are
Proof.
To ensure that our calculations remain precise and accessible, let denote the degree of the vertex . Now, applying the definition of to the graph operation S, together with the degree relation provided in Equation (1), we obtain
Now using minimum and maximum degrees of and , we obtain the lower and the upper bound on FHZI for graph .
□
Example 1.
To calculate the upper and lower bounds of using formulas calculated in Theorem 1. let , , , , , , , , , and . To evaluate the exact value of , it is necessary to obtain the edge partition of the graph , and it is observed that the graph contains 4, 4, and 8 vertices with degree pairs , , and , respectively. Further, Table 1 comprises TI values of factor graphs involved in our results and essential to compute our examples. Then and . We computed the exact value of to be 452, and the bounds on yield a good result as follows: .
Table 1.
Certain relevant invariants of specific graphs.
Example 2.
To compute the upper and lower bounds of using formulas calculated in Theorem 1. let , , , , , , , and , , . The F-sum of with under the Direct product is illustrated in Figure 5.
Figure 5.
F-sum of with under Direct product.
To calculate the actual value of , we require the edge partition of the graph . The number of vertices having degree pairs and is observed to be 12 and 24, respectively. Using the formulas established in Theorem 1, together with the corresponding values of Table 1, we obtain , , and . Clearly, our formulas provide a good estimate in this scenario.
Theorem 2.
Let and be two connected, simple, and finite graphs; then the bounds on FHZI of graph are as follows:
Proof.
Again, for vertex , suppose symbolizes its degree. Then applying the definition of for graph operation R and degree relation provided in Equation (2), we obtain the following:
Now, using minimum and maximum degrees of , to obtain the lower and upper bounds on the FHZI for the graph as follows:
□
Example 3.
Now we check the validity of our bounds derived in Theorem 2, for R-sum graph depicted in Figure 4 where . Using values of TI involved in our bounds from Table 1 the lower and upper bounds of are computed as , . To calculate the exact value of , we require the edge partition of the graph . Upon observation, the edge-cardinality with degree of end-vertex pairs , , and is 8 in each case. The exact value is computed as . It is clearly observed that .
Example 4.
Again, to verify the accuracy of our results presented in Theorem 2 for the R-sum graph illustrated in Figure 5, where and , we use the values of the topological indices involved in our bounds from Table 1. The lower and upper bounds for the of the graph are computed as and , respectively. To determine the exact value of , it is necessary to obtain the edge partition of the graph . It is observed that the edge-cardinality with degree of end-vertex pairs , , and are 6, 12, and 36, in the respective order. Based on the edge partition described, the exact value is calculated as . This result satisfies the bound, .
Theorem 3.
Let and be two connected, simple and finite graphs then the upper and lower bound on FHZI of graph is
Proof.
For vertex belonging to Q-sum under Direct product , suppose symbolizes the degree of . Utilizing the definition of and the degree relation illustrated by Equation (3), we obtain the following:
The sum presented in Equation (12) can be divided into two sums, and , based upon the edge classification. We proceed in the following manner. □
- Classification I: Suppose be placed in edge . ThenNow, replacing sums of suitable TIs, lower and upper degrees of base graphs in Equation (13), we obtain the following results.
- Classification II: Suppose vertices and be placed in the edges and belonging to . ThenNow, replacing sums of suitable TIs, lower and upper degrees of base graphs in Equation (16), we obtain the following results.Combining Equations (14) with (17) and Equations (15) with (18), we obtain the desired upper and lower bounds of Q-sum under Direct product of with .
Example 5.
To examine the correctness of results established in Theorem 3 for Q-sum graphs, we again take . To calculate the bounds on FHZI using the required parameters and values of relevant TIs from Table 1, we have and . To calculate the actual value of , we require the edge partition of the graph . It is observed that the edge-cardinality with end-vertex degree pairs , , , , and is 4 in each case. The actual calculated value is . In this case, bounds given by our formulas work well.
Example 6.
To compute the upper and lower bounds of using formulas calculated in Theorem 3. Let , , , , , , , , , . For the actual value of , we require partitioning of the edge set of graph , and we detect edges whose end-vertices having degrees , , , and are 12 each. The exact value of FHZI for the Q-sum graph is . Using values of desired TIs from Table 1, the lower and upper bounds are and . In this scenario the bounds computed perform well.
Theorem 4.
Let and be two connected, simple, and finite graphs; then the upper and lower bound on the FHZI of graph are
Proof.
Let represent the degree of the vertex in the T-sum graph under the Direct product, where . Utilizing the definition of the first hyper-Zagreb index for the T-sum graph in conjunction with Equation (4), we obtain
By definition, the T-sum graph is constructed by simultaneously applying the R and Q operations. Consequently, it inherits the edges from both the R-sum and Q-sum graphs. Therefore, and correspond exactly to Equations (9) and (16), respectively. By substituting Equations (9) and (18) into Equation (19), we obtain the required formula for the lower bound of for T-sum graphs. Similarly, by substituting Equations (9) and (17) into Equation (19), the upper bound on for T-sum graphs is derived. The validity of the formulas of bounds for T-sum under the Direct product will automatically be guaranteed for both examples of graphs and as T-sum is attained from R-sum and Q-sum, simultaneously. □
2.1. Numerical Illustration
To validate the derived closed-form relations, we evaluated the first hyper-Zagreb index for several representative tensor-based F-sum graphs. Table 2 lists numerical results for small cases of and , confirming agreement with the analytical bounds established in Section 3.
Table 2.
Computed values of for selected tensor product graphs.
These values exhibit linear growth consistent with the expected quadratic dependence on degree distribution, verifying the theoretical expressions for under tensor and F-sum graph constructions.
2.2. Comparative Behavior of Related Indices
To further elucidate the sensitivity of the first hyper-Zagreb index , we compared its behavior with the classical first and second Zagreb indices, and , respectively, over identical tensor product graphs. The analysis shows a consistent ordering
which holds across both acyclic and cyclic tensor combinations.
The numerical hierarchy in Table 3 confirms that responds more strongly to local degree fluctuations and non-linear edge interactions, while primarily captures the total degree sum and emphasizes the multiplicities of the degrees of the pairs, integrates both effects quadratically, resulting in enhanced sensitivity to branching, cyclicity, and vertex heterogeneity.
Table 3.
Comparative values of , , and indices for selected tensor product graphs.
This effect is most prominent in dense tensor products (e.g., ), where vertex-degree distributions are highly non-uniform. The amplified values reflect greater topological compactness and potential electron delocalization in corresponding molecular frameworks. Hence, serves as a more discriminating topological descriptor for characterizing molecular complexity, stability, and conjugation density in QSPR and QSAR analyses.
Lemma 1.
Let and be two paths of length n and m, respectively. Then values of for the unary graph operations under direct product are given as:
- 1.
- 2.
- 3.
- 4.
Lemma 2.
Let and be two paths of length n and m, respectively. Then values of for the unary graph operations under direct product are given as follows:
- 1.
- ;
- 2.
- ;
- 3.
- ;
- 4.
- .
3. Conclusions
From a chemical graph theoretical perspective, tensor product operations enable the modeling of a wide range of molecular graphs, including lattice-like crystalline networks, nanotubes, nanotorus graphs, and polymeric or macromolecular structures. For instance, products such as or are used to represent periodic crystalline frameworks and nanostructured surfaces, while can describe linear polymeric chains such as polyphenylene systems. Moreover, in combination with unary graph operations , tensor-based F-sum graphs effectively characterize cross-linked polymer networks and paraline polymeric materials, including bakelite, vulcanite, and PMMA, see Table 4. For a broad class of graphs, particularly F-sum operations involving the Direct product, the computation of upper and lower bounds for a specific topological index is a compelling and significant topic for researchers. Our efforts are directed toward addressing this problem. Specifically, we have derived and presented closed-form formulas for the lower and upper bounds of the first hyper-Zagreb index for four F-sum graph operations based on the Direct product, expressed in terms of the order, size, and topological indices of the original graphs. Furthermore, we extended our formulations to several specific circumstances by contrasting the precise value of with bounds computed with the use of derived formulas. It is evident that the computed bounds perform adequately well and support the validity of our results. An intriguing direction for future research is to extend the results obtained for the first hyper-Zagreb index () of F-sum graphs under the Direct product to other types of graph products, such as the standard (normal) product or the corona product. Another interesting and challenging problem is to determine the conditions under which the lower and upper bounds established in this work become equal.
Table 4.
Chemical interpretation of tensor and F-sum graph operations for representative molecular and polymeric architectures.
The structural analogies summarized in Table 4 highlight how tensor and F-sum graph products serve as powerful abstractions for real molecular systems. These mappings provide a framework to interpret variations in values in terms of molecular branching, cross-linking intensity, and topological symmetry.
Author Contributions
Conceptualization, S.W. and R.I.; methodology, S.W.; software, R.I.; validation, R.I.; formal analysis, R.I.; investigation, R.I.; data curation, R.I.; writing—original draft, S.W.; writing—review and editing, R.I.; visualization, S.W. and R.I.; supervision, S.W.; funding acquisition, S.W. All authors have read and agreed to the published version of the manuscript.
Funding
This research was supported by the KAU Endowment (WAQF) at King Abdulaziz University, Jeddah, Saudi Arabia. The authors gratefully acknowledge the WAQF and the Deanship of Scientific Research (DSR) for their valuable technical and financial support.
Institutional Review Board Statement
Not applicable.
Informed Consent Statement
Not applicable.
Data Availability Statement
The raw data supporting the conclusions of this article will be made available by the authors on request.
Conflicts of Interest
The authors declare no conflicts of interest.
References
- Wiener, H. Structural determination of paraffin boiling points. J. Am. Chem. Soc. 1947, 69, 17–20. [Google Scholar] [CrossRef] [PubMed]
- Randic, M. Characterization of molecular branching. J. Am. Chem. Soc. 1975, 97, 6609–6615. [Google Scholar] [CrossRef]
- Gutman, I.; Das, K.C. The first zagreb index 30 years after. MATCH Commun. Math. Comput. Chem. 2004, 50, 83–92. [Google Scholar]
- Zhou, B. Zagreb indices. MATCH Commun. Math. Comput. Chem. 2004, 52, 113–118. [Google Scholar]
- Zhou, B.; Trinajstić, N. On general sum-connectivity index. J. Math. Chem. 2010, 47, 210–218. [Google Scholar] [CrossRef]
- Kulli, V.R. The Gourava indices and coindices of graphs. Ann. Pure Appl. Math. 2017, 14, 33–38. [Google Scholar] [CrossRef]
- Ranjini, P.S.; Lokesha, V.; Usha, A. Relation between phenylene and hexagonal squeeze using harmonic index. Int. J. Graph Theory 2013, 1, 116–121. [Google Scholar]
- Shirdel, G.H.; Rezapour, H.; Sayadi, A.M. The hyper-Zagreb index grapah operations. Iran. J. Math. Chem. 2013, 4, 213–220. [Google Scholar]
- Wang, S.; Gao, W.; Jamil, M.K.; Farahani, M.R.; Lin, J.B. Bounds Zagreb indices abd Hyper Zagreb indices. Math. Rep. 2019, 21, 93–102. [Google Scholar]
- Weichsel, P.M. The Kronecker product of graphs. Proc. Am. Math. Soc. 1962, 13, 47–52. [Google Scholar] [CrossRef]
- Khalifeh, M.; Yousefi-Azari, H.; Ashrafi, A.R. The first and second Zagreb indices of some graph operations. Discrete Appl. Math. 2009, 157, 804–811. [Google Scholar] [CrossRef]
- Eliasi, M.; Taeri, D. Four new sums of graphs and their Wiener indices. Discret. Appl. Math. 2009, 157, 794–803. [Google Scholar] [CrossRef]
- Pattabiraman, K.; Paulraja, P. On some topological indices of the tensor products of graphs. Discret. Appl. Math. 2012, 160, 267–279. [Google Scholar] [CrossRef]
- Mahdieh, A. Sharp lower bounds on the Narumi–Katayama index of graph operations. Appl. Math. Comput. 2014, 239, 409–421. [Google Scholar] [CrossRef]
- Deng, H.; Sarala, D.; Ayyaswamy, S.; Balachandran, K. The Zagreb indices of four operations of graphs. Appl. Math. Comput. 2016, 275, 422–431. [Google Scholar] [CrossRef]
- Sarala, D.; Deng, H.; Ayyaswamy, S.; Balachandran, K. The Zagreb indices of graphs based on four operations related to the lexicographic product. Appl. Math. Comput. 2017, 309, 156–169. [Google Scholar] [CrossRef]
- Basavanagoud, B.; Patil, S. The hyper-Zagreb index of four operations on graphs. Math. Sci. Lett. 2017, 6, 193–198. [Google Scholar] [CrossRef]
- Imran, M.; Baby, S.; Siddiqui, H.M.A.; Shafiq, M.K. Bounds of topological indices of tensor product of graph operations. Far East J. Math. Sci. 2017, 102, 3067–3091. [Google Scholar] [CrossRef]
- Elumalai, S.; Mansour, T.; Rostami, M.A. New bounds on the hyper-Zagreb index for the simple connected graphs. Electron. J. Graph Theory Appl. (EJGTA) 2018, 6, 166–177. [Google Scholar] [CrossRef]
- Buragohain, J.; Bharali, A.; Mahanta, A. Four New Operations of Graphs Related to Tensor Product and Zagreb Indices. In Mathematical Modeling and Computational Tools, Proceedings of the ICACM 2018, Kharagpur, India, 23–25 November 2018; Springer Proceedings in Mathematics and Statistics; Bhattacharyya, S., Kumar, J., Ghoshal, K., Eds.; Springer: Singapore, 2020; Volume 320. [Google Scholar]
- Basavanagoud, B.; Desai, V.R.; Mirajkar, K.G.; Pooja, B.; Cangul, I.N. Four new tensor products of graphs and their Zagreb indices and coindices. Electron. J. Math. Anal. Appl. 2020, 8, 192–202. [Google Scholar] [CrossRef]
- Deepika, T. VL index and bounds for the tensor products of F-sum graphs. TWMS J. Appl. Eng. Math. 2021, 11, 374–385. [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. |
© 2025 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.