The inverse degree of a graph G with no isolated vertices is defined as the sum of reciprocal of vertex degrees of the graph G. In this paper, we obtain several lower and upper bounds on inverse degree ID(G). Moreover, using computational results, we prove our upper bound is strong and has the smallest deviation from the inverse degree ID(G). Next, we compare inverse degree ID(G) with topological indices (Randić index R(G), geometric-arithmetic index GA(G)) for chemical trees and also we determine the n−vertex chemical trees with the minimum, the second and the third minimum, as well as the second and the third maximum of ID − R. In addition, we correct the second and third minimum Randić index chemical trees in .
|Number of pages||14|
|State||Published - 2018|
Bibliographical noteFunding Information:
2010 Mathematics Subject Classification. Primary 05C07 (mandatory); Secondary 05C35, 05C90 (optionally) Keywords. First Zagreb index, Second Zagreb index, Inverse degree Received: 20 February 2017; Accepted: 31 July 2017 Communicated by Paola Bonacini bResearch supported by the Science and Engineering Research Board, New Delhi, India. (SERB/F/4168/2012-13) Email addresses: firstname.lastname@example.org, Corresponding Author (Suresh Elumalai), email@example.com (Sunilkumar M. Hosamani), firstname.lastname@example.org (Toufik Mansour), email@example.com (Mohammad Ali Rostami)
Research supported by the Science and Engineering Research Board, New Delhi, India. (SERB/F/4168/2012-13) The authors would like to give sincere gratitude the unknown reviewers for careful reading of the manuscript and for valuable comments, which greatly improved quality of our paper. The first author would like to thank his beloved Professor Kinkar Ch. Das for sending us his paper and the kind support.
© 2018, University of Nis. All rights reserved.
- First Zagreb index
- Inverse degree
- Second Zagreb index
ASJC Scopus subject areas
- Mathematics (all)