Ediz, S.2025-05-102025-05-102016978163485721597816348569802-s2.0-85020331461https://hdl.handle.net/20.500.14720/203The reverse vertex degree of a vertex v of a simple connected graph G defined as; cv =δ-dv + 1 where δ denotes the largest of all degrees of vertices of G and dv denotes the number of edges incident to v. The second reverse Zagreb index of a simple connected graph G defined as; CM2 (G) = σuv2E(G) cucv. In this paper we characterized maximum chemical trees with respect to the second reverse Zagreb index. © 2017 by Nova Science Publishers, Inc. All rights reserved.eninfo:eu-repo/semantics/closedAccessReverse Vertex DegreeReverse Zagreb IndicesSecond Reverse Zagreb IndexBook PartN/AN/A289293