Discover published sets by community

A graph in which every pair of vertices is connected by an edge.

An acyclic connected graph. It is a special case of a graph with no cycles (called acyclic), and exactly one path between every pair of vertices.

A graph that consists of a single cycle, or in other words, some number of vertices connected in a closed chain.

A graph in which one vertex (the 'center') is connected to all other vertices, which have no other connections.

A graph whose vertices can be divided into two disjoint sets such that every edge connects a vertex in one set to a vertex in the other set.

A graph where the vertices can be lined up in a straight line so that all edges are between consecutive pairs of vertices.

A graph where all vertices have degree 3.

A graph formed from the vertices and edges of a hypercube. It is a graph where vertices represent the corners of an n-dimensional cube and edges represent the cube's edges.

A graph with a cycle of $n$ vertices connected to a single central vertex, creating $n$ spokes.