Bounds on the Number of Possible Distinct Networks

This note is concerned with the number of all distinct networks, also called connected graphs, or Cayley, or linear graphs that are possible for
n
given nodes. Since for any practical number of nodes an explicit enumeration appears difficult, if not impossible, we offer an improved lower bound that enables tight approximation for
n
reasonably large.