Authors: Paul D. Manuel
Addresses: Department of Information Science, College of Computing Sciences and Engineering, Kuwait University, Kuwait
Abstract: The number of matching's in a graph is known as the Hosoya index of the graph. The problem of computing Hosoya index is #P-complete. If the adjacent edges are sequentially ordered, then we show that a polynomial algorithm can be designed. The significance of this algorithm is demonstrated by computing Hosoya index for certain chemical compounds such as Pyroxene. This algorithm can be applied to grid like chemical compounds such as sodium chloride, carbon nanotubes, naphtalenic nanotube etc.
Keywords: Hosoya index; cheminformatics; carbon nanotubes; #P-complete.
International Journal of Computer Aided Engineering and Technology, 2019 Vol.11 No.2, pp.196 - 205
Accepted: 19 Jan 2018
Published online: 26 Dec 2018 *