Let G = (V, E) be a connected graph and d(u, v) denote the distance between the vertices u and v in G. A set of vertices W resolves a graph G if every vertex is uniquely determined by its vector of distances to the vertices in W. A metric dimension of G is the minimum cardinality of a resolving set of G and is denoted by dim(G). Let J_2n,m be a m-level gear graph obtained by m-level wheel graph W_2n,m ≅ mC_2n + k₁ by alternatively deleting n spokes of each copy of C_2n and J_3n be a generalized gear graph obtained by alternately deleting 2n spokes of the wheel graph W_3n. In this paper, the metric dimension of certain gear graphs J_2n,m and J_3n generated by wheel has been computed. Also this study extends the previous result given by Tomescu et al. in 2007.

In the fields of mathematical chemistry, a topological index, also known as a connectivity index, is a type of a molecular descriptor that is calculated based on the molecular graph of a chemical compound. Topological indices are an analytical framework of a graph which portray its topology and are mostly equal graphs. Topological indices (TIs) are numeral quantities that are used to foresee the natural correlation among the physicochemical properties of the chemical compounds in their fundamental network. TIs show an essential role in the theoretical abstract and environmental chemistry and pharmacology. In this paper, we compute many latest developed degree-based TIs. An analogy among the computed different versions of the TIs with the help of the numerical values and their graphs is also included .In this article, we compute the first Zagreb index, second Zagreb index, hyper Zagreb index, ABC Index, GA Index, and first Zagreb polynomial and second Zagreb polynomial of chemical graphs polythiophene, nylon 6,6, and the backbone structure of DNA.