petersen_graph(create_using=None)
The Peterson graph is a cubic, undirected graph with 10 nodes and 15 edges . Julius Petersen constructed the graph as the smallest counterexample against the claim that a connected bridgeless cubic graph has an edge colouring with three colours .
Graph type to create. If graph instance, then cleared before populated.
Petersen graph
Returns the Petersen graph.
The following pages refer to to this document either explicitly or contain code examples using this.
networkx.drawing.nx_agraph.pygraphviz_layout
networkx.algorithms.connectivity.kcomponents.k_components
networkx.algorithms.approximation.kcomponents.k_components
networkx.algorithms.euler.is_eulerian
networkx.drawing.nx_agraph.graphviz_layout
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