circular_ladder_graph#

circular_ladder_graph(n, create_using=None)[源代码]#

返回圆形梯形图 \(CL_n\) 长度为n的。

\(CL_n\) consists of two concentric n-cycles in which each of the n pairs of concentric nodes are joined by an edge.

节点标签是0到n-1的整数