geodetic graph
graph whose shortest paths are unique
block graph
graph whose biconnected components are all cliques
barbell graph
type of undirected graph consisting of two non-overlapping n-vertex cliques together with a single edge that has an endpoint in each clique
lollipop graph
type of graph consisting of a clique on m vertices and a path graph on n vertices, connected with a bridge
Petersen graph
cubic graph with 10 vertices and 15 edges
complete graph
simple undirected graph in which every pair of distinct vertices is connected by a unique edge