Iranian Journal of Mathematical Chemistry
Year:2018 | Volume:9 | Issue:4 |Papers Count:5

As highly discriminant distance-based topological indices, the Balaban index and the sum-Balaban index of a graph 􀜩 are defined as...

In this paper we introduce a novel methodology to transmit the origin to the center of a polygon in a molecule structure such that the special axis be perpendicular to the plane containing the polygon. The mathematical calculations are described completely and the algorithm will be showed as a computer program.

Recently two new degree concepts have been defined in graph theory: ev-degree and ve-degree. Also the ev-degree and ve-degree Zagreb and Randić indices have been defined very recently as parallel of the classical definitions of Zagreb and Randić indices. It was shown that ev-degree and ve-degree topological indices can be used as possible tools in QSPR researches [2]. In this paper, we define the ve-degree and ev-degree Narumi– Katayama indices, investigate the predicting power of these novel indices and extremal graphs with respect to these novel topological indices. Also we give some basic mathematical properties of ev-degree and ve-degree Narumi-Katayama and Zagreb indices.

Let 􀜩 be a finite and simple graph with edge set 􀜧 (􀜩 ). The second geometric-arithmetic Index is defined as...

Let 􀜩 = (􀜸 , 􀜧 ) be a simple connected graph. A matching 􀜯 in a graph 􀜩 is a collection of edges of 􀜩 such that no two edges from 􀜯 share a vertex. A matching 􀜯 is maximal if it cannot be extended to a larger matching in 􀜩 . The cardinality of any smallest maximal matching in 􀜩 is the saturation number of 􀜩 and is denoted by 􀝏 (􀜩 ). In this paper we study the saturation number of the corona product of two specific graphs. We also consider some graphs with certain constructions that are of importance in chemistry and study their saturation number.