Let $G=(V,E)$ be a simple connected graph. A matching $M$ in a graph $G$ is a collection of edges of $G$ such that no two edges from $M$ share a vertex. A matching $M$ is maximal if it cannot be extended to a larger matching ...

As highly discriminant distance-based topological indices, the Balaban index and the sum-Balaban index of a graph $G$ are defined as $J(G)=frac{m}{mu+1}sumlimits_{uvin E} frac{1}{sqrt{D_{G}(u)D_{G}(v)}}$ and $SJ(G)=frac{ ...

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 ...

Recently two new degree concepts have been defined in graph theory: ev-degree and ve-degree. Also the evdegree and ve-degree Zagreb and Randić indices have been defined very recently as parallel of the classical definitions ...