construct generalized Petersen graph
positive integer >=3
The GeneralizedPetersenGraph(n,k) command returns the generalized Petersen graph with the given parameters.
If n and k are relatively prime, the graph consists of two cycles of length n with a perfect matching between their vertices. The i'th vertex of the first cycle is connected to the ki'th vertex on the second cycle.
If n and k are not relatively prime, the graph consists of one cycle of length n perfectly matched to another set of n vertices forming gcd(k,n) cycles of length n/gcd(k,n).
P ≔ GeneralizedPetersenGraph⁡5,2
P≔Graph 1: an undirected graph with 10 vertices and 15 edge(s)
P ≔ GeneralizedPetersenGraph⁡6,2
P≔Graph 2: an undirected graph with 12 vertices and 18 edge(s)
Download Help Document
What kind of issue would you like to report? (Optional)