Abstract
The symmetric division deg (SDD) index is among the 148 discrete Adriatic indices that were developed about a decade ago. Motivated by the success of the SDD index, Ghorbani et al. in a recent paper proposed the inverse version of this index and called it the inverse symmetric division deg (ISDD) index. In the aforementioned paper, the graphs possessing the maximum and minimum ISDD index over the set of all tree graphs having the given order were found. The present paper addresses the problem of finding the graphs having the largest and smallest ISDD index from the set of all connected unicyclic graphs having the specified order.