Bounds on Harary index

Research output: Contribution to journalArticlepeer-review

56 Scopus citations

Abstract

In this paper, we obtain the lower and upper bounds on the Harary index of a connected graph (molecular graph), and, in particular, of a triangle- and quadrangle-free graphs in terms of the number of vertices, the number of edges and the diameter. We give the Nordhaus-Gaddum-type result for Harary index using the diameters of the graph and its complement. Moreover, we compare Harary index and reciprocal complementary Wiener number for graphs.

Original languageEnglish
Pages (from-to)1377-1393
Number of pages17
JournalJournal of Mathematical Chemistry
Volume46
Issue number4
DOIs
StatePublished - Oct 2009

Keywords

  • Diameter
  • Harary index
  • Lower bound
  • Quadrangle-free graphs
  • Triangle-free graphs
  • Upper bound

Fingerprint

Dive into the research topics of 'Bounds on Harary index'. Together they form a unique fingerprint.

Cite this