On Analysis of Banhatti Indices for Hyaluronic Acid Curcumin and Hydroxychloroquine

Topological indices are numerical numbers assigned to the graph/structure and are useful to predict certain physical/chemical properties. In this paper, we give explicit expressions of novel Banhatti indices, namely, first K Banhatti index B 1 G , second K Banhatti index B 2 G , first K hyper-Banhatti index HB 1 G , second K hyper-Banhatti index HB 2 G , and K Banhatti harmonic index H b G for hyaluronic acid curcumin and hydroxychloroquine. The multiplicative version of these indices is also computed for these structures.

On Analysis of Topological Aspects for Subdivision of Kragujevac Tree Networks

In this paper, we have taken review of certain topological topological characteristics of subdivision and the line graph of subdivision of Kragujevac tree. A Kragujevac tree is denoted by K , K ∈ Kg q = r 2 t + 1 + 1 , r , with order r 2 t + 1 + 1 and size r 2 t + 1 , respectively. We have computed the Zagreb polynomials, forgotten polynomial, and M-polynomial for Kragujevac tree. Moreover, we have computed topological indices like Zagreb-type indices, reduced reciprocal Randić indices, family of Gourava indices as well as forgotten index. Further, some topological indices that can be directly derived from M-polynomial, i.e., first and second Zagreb index, modified second Zagreb index, Randić and reciprocal Randić index, symmetric division and harmonic index, and inverse sum and augmented Zagreb index are also computed.

General sum-connectivity index of unicyclic graphs with given diameter and girth

Topological indices of graphs have been studied due to their extensive applications in chemistry. We obtain lower bounds on the general sum-connectivity index [Formula: see text] for unicyclic graphs [Formula: see text] of given girth and diameter, and for unicyclic graphs of given diameter, where [Formula: see text]. We present the extremal graphs for all the bounds. Our results generalize previously known results on the harmonic index for unicyclic graphs of given diameter.

On the Computation of Some Topological Descriptors to Find Closed Formulas for Certain Chemical Graphs

In this research paper, we will compute the topological indices (degree based) such as the ordinary generalized geometric-arithmetic (OGA) index, first and second Gourava indices, first and second hyper-Gourava indices, general Randic´ index R γ G , for γ = ± 1 , ± 1 / 2 , harmonic index, general version of the harmonic index, atom-bond connectivity (ABC) index, SK, SK1, and SK2 indices, sum-connectivity index, general sum-connectivity index, and first general Zagreb and forgotten topological indices for various types of chemical networks such as the subdivided polythiophene network, subdivided hexagonal network, subdivided backbone DNA network, and subdivided honeycomb network. The discussion on the aforementioned networks will give us very remarkable results by using the aforementioned topological indices.

On Certain Aspects of Topological Indices

A topological index, also known as connectivity index, is a molecular structure descriptor calculated from a molecular graph of a chemical compound which characterizes its topology. Various topological indices are categorized based on their degree, distance, and spectrum. In this study, we calculated and analyzed the degree-based topological indices such as first general Zagreb index M r G , geometric arithmetic index GA G , harmonic index H G , general version of harmonic index H r G , sum connectivity index λ G , general sum connectivity index λ r G , forgotten topological index F G , and many more for the Robertson apex graph. Additionally, we calculated the newly developed topological indices such as the AG 2 G and Sanskruti index for the Robertson apex graph G.

On the Harmonic Index and the Signless Laplacian Spectral Radius of Graphs

The harmonic index of a conected graph G is defined as H(G) = ∑ uv∈E(G) 2 d(u)+d-(v), where E(G) is the edge set of G, d(u) and d(v) are the degrees of vertices u and v, respectively. The spectral radius of a square matrix M is the maximum among the absolute values of the eigenvalues of M. Let q(G) be the spectral radius of the signless Laplacian matrix Q(G) = D(G) + A(G), where D(G) is the diagonal matrix having degrees of the vertices on the main diagonal and A(G) is the (0, 1) adjacency matrix of G. The harmonic index of a graph G and the spectral radius of the matrix Q(G) have been extensively studied. We investigate the relationship between the harmonic index of a graph G and the spectral radius of the matrix Q(G). We prove that for a connected graph G with n vertices, we have ( 2 || ----n----- ||{ 2 (n − 1), if n ≥ 6, -q(G-)- ≤ | 16-, if n = 5, H (G ) || 5 |( 3, if n = 4, and the bounds are best possible.