Analysis of Eigenvalues for Molecular Structures
Source abstract
Abstract
In this article, we study different molecular structures such as Polythiophene network, for and , Orthosilicate (Nesosilicate) , Pyrosilicates (Sorosilicates) , Chain silicates (Pyroxenes), and Cyclic silicates (Ring Silicates) for their cardinalities, chromatic numbers, graph variations, eigenvalues obtained from the adjacency matrices which are square matrices in order and their corresponding characteristics polynomials. We convert the general structures of these chemical networks in to mathematical graphical structures. We transform the molecular structures of these chemical networks which are mentioned above, into a simple and undirected planar graph and sketch them with various techniques of mathematics. The matrices obtained from these simple undirected graphs are symmetric. We also label the molecular structures by assigning different colors. Their graphs have also been studied for analysis. For a connected graph, the eigenvalue that shows its peak point (largest value) obtained from the adjacency matrix has multiplicity 1. Therefore, the gap between the largest and its smallest eigenvalues is interlinked with some form of “connectivity measurement of the structural graph”. We also note that the chemical structures, Orthosilicate (Nesosilicate) , Pyrosilicates (Sorosilicates) , Chain silicates (Pyroxenes) , and Cyclic silicates (Ring Silicates) generally have two same eigenvalues. Adjacency matrices have great importance in the field of computer science.
Source: openalex_inverted_index · Quality: baseline
Research context
OpenAlex topics: Graph theory and applications · Computational Drug Discovery Methods · Topological and Geometric Data Analysis
SciVX discovery tags are terminology-based. OpenAlex topics are source-provided classifications.
References (14)
Show source-provided references
1. Von Collatz · Abhandlungen Mathematical Seminar · 1957 · 63
2. Expander graphs and their applications10.1090/S0273-0979-06-01126-8 ↗
3. Pseudo-random graphs10.1007/978-3-540-32439-3_10 ↗
4. On the computation of some topological descriptors to find closed formulas for certain chemical graphs10.1155/2021/5533619 ↗
5. Two-dimensional cross-linked polythiophene network10.1039/C9TC02461A ↗
6. Topological properties of silicate networks
7. Topological properties of few poly oxide, poly silicate, dox and dsl networks10.7763/IJFCC.2013.V2.128 ↗
8. On the computation of topological indices for molecular structures of subdivided aztec diamonds
9. Topological invariants for the general structure of grape seed proanthocyanidins10.52280/pujm.2022.540104 ↗
10. Eigenvalues and expanders10.1007/BF02579166 ↗
11. , isoperimetric inequalities for graphs and superconcentrators10.1016/0095-8956(85)90092-9 ↗
12. On the optimality of J. cheeger and P. buser inequalities10.1016/S0926-2245(03)00035-4 ↗
13. Measurable chromatic number of geometric graphs and sets without some distances in Euclidean space10.1007/BF02579223 ↗
14. Irregularity in graphs