A table of simple cubic graphs provides a list of cubic graphs, which are graphs where every vertex has a degree of exactly 3 (i.e., each vertex is connected to exactly three edges). Simple cubic graphs have no loops or multiple edges between the same pair of vertices. These graphs are also known as 3-regular graphs. A common way to organize and present simple cubic graphs is by their number of vertices (usually denoted as \( n \)).