networkx.generators.classic.barbell_graph¶

barbell_graph
(m1, m2, create_using=None)[source]¶ Returns the Barbell Graph: two complete graphs connected by a path.
For \(m1 > 1\) and \(m2 >= 0\).
Two identical complete graphs \(K_{m1}\) form the left and right bells, and are connected by a path \(P_{m2}\).
 The
2*m1+m2
nodes are numbered 0, ..., m11
for the left barbell,m1, ..., m1+m21
for the path, andm1+m2, ..., 2*m1+m21
for the right barbell.
The 3 subgraphs are joined via the edges
(m11, m1)
and(m1+m21, m1+m2)
. Ifm2=0
, this is merely two complete graphs joined together.This graph is an extremal example in David Aldous and Jim Fill’s etext on Random Walks on Graphs.
 The