Ordering tetracyclic connected graphs having minimum degree distance

Abstract

Degree distance is an important molecular descriptor which has gained much attention in the recent past. It provides valuable insights into the connectivity and properties of molecular graphs, making it a powerful tool in chemical graph theory. Ordering of graphs with certain parameters allows chemists to identify patterns and trends of different chemical compounds and as a result, predict their reaction behaviour accordingly. In this paper, first ten graphs are presented which have minimum degree distance in the class of tetracyclic connected graphs provided n ≥ 15, along with their values (in ascending order).