Barbell graph

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]

Barbell graph
A barbell graph on 16 vertices.
Vertices
Edges
Propertiesconnected
Table of graphs and parameters

See also

References


This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.