There is no definitive answer to this question as it depends on a number of factors, including the specific networks under consideration and how they are defined. However, if we consider smallness in terms of the number of nodes (or vertices) and edges in a network, then some possible contenders for the title of smallest network would be complete graphs, path graphs or cycle graphs.
