Construction of neighbourly irregular chemical graphs among p-block elements and it’s size

Author: 
Arockia Aruldoss J and Arunambigai M

A connected graph G is said to be Neighbourly Irregular, if no two adjacent vertices of G have the same degree. Given a positive integer n and a partition of n with distinct parts. In this paper, we could derive some Neighbourly Irregular Chemical Graphs (NICG) of molecular structure which is derived from the p-block elements in the area of Inorganic Chemistry. Considering the atoms as vertices, covalent bond as edges, and valency as degree of vertices. Also I have derived the size of such Neighbourly Irregular Chemical Graphs.

Download PDF: 
Conference: