octahedral_graph(create_using=None)
The octahedral graph is the 6-node 12-edge Platonic graph having the connectivity of the octahedron . If 6 couples go to a party, and each person shakes hands with every person except his or her partner, then this graph describes the set of handshakes that take place; for this reason it is also called the cocktail party graph .
Graph type to create. If graph instance, then cleared before populated.
Octahedral graph
Returns the Platonic Octahedral graph.
The following pages refer to to this document either explicitly or contain code examples using this.
networkx.algorithms.approximation.connectivity.local_node_connectivity
networkx.algorithms.approximation.connectivity.node_connectivity
Hover to see nodes names; edges to Self not shown, Caped at 50 nodes.
Using a canvas is more power efficient and can get hundred of nodes ; but does not allow hyperlinks; , arrows or text (beyond on hover)
SVG is more flexible but power hungry; and does not scale well to 50 + nodes.
All aboves nodes referred to, (or are referred from) current nodes; Edges from Self to other have been omitted (or all nodes would be connected to the central node "self" which is not useful). Nodes are colored by the library they belong to, and scaled with the number of references pointing them