10 September 2022 in International Journal of Foundations of Computer Science
2 October 2024 in Combinatorial Chemistry & High Throughput Screening
Background: The number of atoms producing a bond with an atom a in a molecular structure (graph) is regarded as the valency of a. A number of molecular structures have been topologically characterized via a large number of valency-based topological indices, which correlate certain physio-chemical properties like boiling point, stability, strain energy, and many more chemical compounds. Objective: Our intention is to perform the topological characterization of primitive coronoid structures initially on the base of seven different valency-based topological indices. Fundamentally, our purpose is to provide the universal formula by using the topological characterization of any primitive coronoid structures with any valency-based topological index. Method: The technique of atom-bonds partitions according to the valency of atoms besides counting principals are used to find the results. Results: Exact values of valency-based topological index, namely the Randic index, sum connectivity index, harmonic index, atom bond connectivity index, geometric arithmetic index, forgotten index, and symmetric division index are calculated coronoid structures initially constructed with at most three benzene lyres. All these indices are valency-dependent structural invariants that have been used to elaborate several chemical properties of compounds of the structure. Conclusion: Moreover, we provide the general formula to compute any valency-based topological index for any type of coronoid structure constructed with any number of benzene lyres.
16 July 2026 in Ikonion Journal of Mathematics
For a simple graph $G$, the Laplacian matrix is denoted by $L(G)$ and the Signless Laplacian matrix is denoted by $Q(G)$. These matrices and their eigenvalues are widely used in many fields such as network measurement and chemical structures. Laplacian energy of a graph $G$ of order $n$ is defined as $LE(G)= \sum_{i=1}^n \ |\mu_i-\overline d |$, where $\mu_i$ is the $i$-th eigenvalue of Laplacian matrix of $G$, and $\overline d$ is average degree. Similarly, the Quasi-Laplacian energy of the graph $G$ of order $n$ is defined as $E_Q(G)= \sum_{i=1}^n \ \sigma_i^2$, where $\sigma_i$ is the $i$-th eigenvalue of Signless Laplacian matrix of $G$.The inequality $LE(P_n) \leq LE(T_n) \leq LE(S_n)$ was given as conjecture by Radenković and Gutman in 2007. This conjucture was proved by Trevisan et al. for trees with 3 diameters and by Rehman et al. for trees with 4 diameters. Our aim is to prove this conjecture for trees with larger diameters. In this study, we solved the above conjecture for some tree classes between 5 and 15 in diameter by the linear time algorithm for characteristic polynomials. It is also proved ${E_Q}\left( {{P_n}} \right) \le {E_Q}\left( {{T_n}} \right) \le {E_Q}\left( {{S_n}} \right) $ inequality, which is similar to Gutman's conjecture for the Quasi-Laplacian energy.