On Non-Neighbor Zagreb Indices and Non-Neighbor Harmonic Index

Abstract

A graph can be represented by a matrix, a sequence, a polynomial and a number which represents the whole graph. The representation of the graph by a unique number is called topological index. Computation of topological indices is a recent research problem in mathematical and computational chemistry. There are some special classes of topological indices such as distance based, degree based and counting related topological indices which have their own chemical significance. In this paper we introduce the computation of topological indices called Non-Neighbor First Zagreb Index, Non-Neighbor Second Zagreb Index and Non-Neighbor Harmonic Index based on the non-neighbors of the vertices of a graph.