Connected Graph

A Connected Graph is a graph with a graph path between every graph node tuple with distinct members.

• AKA: Connected Network.
• Context:
  • It can range from being a Connected Directed Graph to being an Unconnected Directed Graph.
  • It can range from being a Fully-Connected Graph to being a Partially-Connected Graph.
  • …
• Example(s):
  • …
• Counter-Example(s):
  • a Non-Connected Graph, such as the Dark Web.
• See: k-Node Connected Graph, k-Edge Connected Graph, Connected Network, Semantic Network, R iGraph Clusters.

---

---

References

2009

• http://en.wikipedia.org/wiki/Connectivity_(graph_theory)#Definitions_of_components.2C_cuts_and_connectivity
  • A graph is called connected if every pair of distinct vertices in the graph can be connected through some path.
• http://en.wiktionary.org/wiki/connected_graph
  • (mathematics) A graph in which each point (node) is connected to every other point

---