RESUMO
Counting Polynomial is the mathematical function that was initially introduced for application in chemistry in 1936 by G. Polya. Partitioning of graphs can be seen in the coefficients of these mathematical functions, which also reveal the frequency with which these partitions happen. We developed a novel and efficient method for constructing the necessary counting polynomials for a zigzag-edge coronoid formed by the fusion of a Starphene graph and a Kekulenes graph. The study's methods expand our knowledge, and its findings potentially provide insight on the topology of these chemical structures.
RESUMO
In this paper, we investigate and explore the properties of quasi-topological loops with respect to irresoluteness. Moreover, we construct an example of a quasi-irresolute topological inverse property-loop by using a zero-dimensional additive metrizable perfect topological inverse property-loop L∗ with relative topology τL'.
RESUMO
This Article has been retracted.
RESUMO
Graph theoretical concepts are broadly used in several fields to examine and model various applications. In computational chemistry, the characteristics of a molecular compound can be assessed with the help of a numerical value, known as a topological index. Topological indices are extensively used to study the molecular mechanics in QSAR and QSPR modeling. In this study, we have developed the closed formulae to estimate ABC, ABC4, GA, and GA5 topological indices for the graphical structures of boron nitride and carbon nanotube.
RESUMO
A topological index of a molecular structure is a numerical quantity that differentiates between a base molecular structure and its branching pattern and helps in understanding the physical, chemical and biological properties of molecular structures. In this article, we quantify four counting polynomials and their related topological indices for the series of a concealed non-Kekulean benzenoid graph. Moreover, we device a new method to calculate the PI and Sd indices with the help of Theta and Omega polynomials.