Barbell graph

Barbell graph
Vertices	$2n$
Edges	$2\cdot\tbinom n2 + 1$
Properties	connected

In the mathematical discipline of graph theory, the n-barbell graph is a special type of undirected graph consisting of two non-overlapping n-vertex cliques together with a single edge that has an endpoint in each clique.^[1]

See also

• Lollipop graph
• Tadpole graph

References

1. Weisstein, Eric W., "Barbell Graph", MathWorld.