Ordering Tricyclic Connected Graphs Having Minimum Degree Distance
نویسندگان
1 Department of Mathematics, Abbottabad University of Science and Technology, Abbottabad, KPK, Pakistan
2 Department of Mathematics, Abbottabad University of Science and Technology, Abbottabad, KPK, Pakistan
3 Department of Mathematics, Abbottabad University of Science and Technology, Abbottabad, KPK, Pakistan
4 Department of Mathematics, Abbottabad University of Science and Technology, Abbottabad, KPK, Pakistan
doi
10.22052/ijmc.2025.255360.1895چکیده
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 $n\ge31$.
