ordering tricyclic connected graphs having minimum degree distance

‎degree distance d’(g) is an important molecular descriptor which provides valuable insights into the connectivity and properties of molecular graphs‎, ‎making it a powerful tool in diverse areas of chemical graph theory‎. ‎this descriptor has attained much attention in the recent past for its broad range of applicability in different problems of 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 behavior accordingly‎. ‎in this paper‎, ‎the first sixteen tricyclic graphs are presented which have minimum degree distances (in ascending order) if $nge31$.