We call a network on $n$n vertices complete if every vertex is connected to every other vertex. There is exactly one complete network for each value of $n$n.
If we take a network and delete some edges, or some of its vertices (and all edges connected to it), we obtain a subnetwork of the original. We often say that one network is a subnetwork of another network if we can get from one to the other through these deletions. For example, any simple network that has $n$n vertices is a subnetwork of the complete network with $n$n vertices - we can just add or delete edges to get from one to the other:
For an undirected network, we call it connected if we can move from any vertex to any other vertex, and disconnected if we can’t. We use the same words for a directed network, though we allow ourselves to move along the (directed) edges in both directions.
These ideas comes up frequently in chemistry, as chemicals are frequently represented as a network. Here are three examples:
These three chemicals have a common subnetwork - the “benzene ring” of six carbon atoms, with some hydrogens still attached:
Each of the three chemical’s networks have a single edge connecting this network to the top part, called the "functional group". Nature, and human chemistry, routinely takes a functional group from a molecule and replaces it with another by deleting and then restoring the edge - you can investigate these biochemical pathways (represented as a network) further here.