✳flâneur — a map of the web's best reading

Cubic graph - Wikipedia

en.wikipedia.org · 2,031 words · saved by 1 readers

In the mathematical field of graph theory, a cubic graph is a graph in which all vertices have degree three. In other words, a cubic graph is a 3-regular graph. Cubic graphs are also called trivalent graphs. A bicubic graph is a cubic bipartite graph. In 1932, Ronald M. Foster began collecting examples of cubic symmetric graphs, forming the start of the Foster census.[1] Many well-known individual graphs are cubic and symmetric, including the utility graph, the Petersen graph, the Heawood graph, the Möbius–Kantor graph, the Pappus graph, the Desargues graph, the Nauru graph, the Coxeter graph, the Tutte–Coxeter graph, the Dyck graph, the Foster graph and the Biggs–Smith graph. W. T. Tutte classified the symmetric cubic graphs by the smallest integer number s such that each two oriented paths of length s can be mapped to each other by exactly one symmetry of the graph. He showed that s is at most 5, and provided examples of graphs with each possible value of s from 1 to 5.[2] Semi-symme

Cubic graph - Wikipedia Jump to content From Wikipedia, the free encyclopedia Graph with all vertices of degree 3 Not to be confused with graphs of cubic functions , hypercube graph , cube graph , cubical graph . The Petersen graph is a cubic graph. The complete bipartite graph K 3 , 3 {\displaystyle K_{3,3}} is an example of a bicubic graph In the mathematical field of graph theory , a cubic graph is a graph in which all vertices have degree three. In other words, a cubic graph is a 3- regular graph . Cubic graphs are also called trivalent graphs . A bicubic graph is a cubic bipartite graph .

Explore this link on the map →

related reading