The Steiner antipodal number of a graph determines the minimum number of vertices needed to create a specific type of graph. The researchers in this study calculated the Steiner antipodal number for various types of graphs, including trees and unicyclic graphs. They found that for any positive integer k, there exists a tree and a unicyclic graph with a Steiner antipodal number of k. Additionally, they showed that the Steiner antipodal number is not influenced by other graph properties like the domination number or chromatic number.