Fully-Connected Network

From GM-RKB
(Redirected from Fully-Connected Graph)
Jump to navigation Jump to search

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



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.