icosahedral_graph(create_using=None)
The icosahedral graph has 12 nodes and 30 edges. It is a Platonic graph whose nodes have the connectivity of the icosahedron. It is undirected, regular and Hamiltonian .
Graph type to create. If graph instance, then cleared before populated.
Icosahedral graph with 12 nodes and 30 edges.
Returns the Platonic Icosahedral graph.
The following pages refer to to this document either explicitly or contain code examples using this.
networkx.algorithms.connectivity.connectivity.edge_connectivity
networkx.algorithms.connectivity.cuts.minimum_node_cut
networkx.algorithms.connectivity.disjoint_paths.edge_disjoint_paths
networkx.algorithms.connectivity.cuts.minimum_edge_cut
networkx.algorithms.connectivity.connectivity.local_node_connectivity
networkx.algorithms.distance_regular.intersection_array
networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
networkx.algorithms.connectivity.connectivity.local_edge_connectivity
networkx.algorithms.connectivity.connectivity.node_connectivity
networkx.algorithms.connectivity.cuts.minimum_st_node_cut
networkx.algorithms.connectivity.disjoint_paths.node_disjoint_paths
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