A
A. Usha
Researcher at Alliance University
Publications - 7
Citations - 53
A. Usha is an academic researcher from Alliance University. The author has contributed to research in topics: Topological index & 1-planar graph. The author has an hindex of 2, co-authored 7 publications receiving 14 citations.
Papers
More filters
Journal ArticleDOI
Graph entropies of porous graphene using topological indices
TL;DR: The calculated values of topological indices, degree and edge weighted entropy of graph, and the entropy measures are calculated viz., First Zagreb entropy, Second Zag Croatia entropy, Randic entropy, Reciprocal Randi entropy, Atom-bond connectivity entropy, Geometric arithmetic entropy, Harmonic entropy, Sum-connectivity entropy, ABC 4 entropy and GA 5 entropy for the porous graphene structure.
Journal ArticleDOI
M-polynomial and neighborhood M-polynomial methods for topological indices of porous graphene
TL;DR: In this article, the M-polynomial and NM polynomial of porous graphene structure were obtained using these polynomials as tools, and certain degree-based topological indices were retrieved.
Journal ArticleDOI
Computing SS Index of Certain Dendrimers
TL;DR: In this article, a novel topological index known as SS index is introduced and computed for four dendrimer structures and the strong correlation coefficient between SS index and five physico-chemical characteristics such as boiling point (bp), molar volume (mv) molar refraction (mr), heats of vaporization (hv), and critical pressure (cp) of 67 alkane isomers have been determined.
Journal ArticleDOI
Novel Degree-Based Topological Descriptors of Carbon Nanotubes
TL;DR: In this article, an attempt is made in defining three novel descriptors, namely, neighborhood geometric-harmonic, harmonic-geometric, and neighborhood harmonic geometrical indices.
Journal ArticleDOI
Harmonic index of cubic polyhedral graphs using bridge graphs
TL;DR: In this paper, the Harmonic indices of cubic polyhedral graphs using bridge graphs and the relations among them have been found, where the vertex-set and edge-set are represented by V (G) and E(G) respectively.