Fully-Connected Network

A Fully-Connected Network is a connected graph that is complete graph, i.e. all the nodes are interconnected.

• AKA: Fully-Connected Mesh Network.
• Context:
  • It can range from being a Fully-Connect Directed Graph to being a Fully-Connected Undirected Graph.
  • …
• Example(s):
  • .
  • .
  • .
• Counter-Example(s):
  • a Fully-Connected Neural Network.
  • a Partially Connected Network.
  • a Bus Network.
  • a Star Network.
  • a Ring Network.
  • a Hybrid Network.
  • a Tree Network.
  • a Point-to-Point Network.
  • a Daisy Chain.
• See: Mesh Network, Directed Graph, Metcalfe's Law, Reed's Law, Neural Networks.

---

---

References

2017

• (Wikipedia, 2017) ⇒ https://en.wikipedia.org/wiki/Network_topology#Fully_connected_network Retrieved:2017-12-17.
  • In a fully connected network, all nodes are interconnected. (In graph theory this is called a complete graph.) The simplest fully connected network is a two-node network. A fully connected network doesn't need to use packet switching or broadcasting. However, since the number of connections grows quadratically with the number of nodes: This kind of topology does not trip and affect other nodes in the network [math]\displaystyle{ c= \frac{n(n-1)}{2}.\, }[/math] This makes it impractical for large networks.

---