Cubic graph

A simple graph is called cubic in graph theory, if all of its nodes have degree 3. Alternatively, it is also called 3- regular.

Cubic graphs are so regular graphs. Since 1- regular graphs represent only a pairing and decompose 2- regular graph into disjoint cycles, cubic graphs are sogesehen the simplest cases nichttrivalen regular graphs.

Since the sum of degrees of nodes in simple graphs must always be straight, have cubic graphs always just the number of nodes.

  • Regular graph
Graph (mathematics)#Simple graph Disjoint sets
490397
de