This partial list of graphs contains definitions of graphs and graph families. For collected definitions of graph theory terms that do not refer to individual graph types, such as vertex and path, see Glossary of graph theory. For links to existing articles about particular kinds of graphs, see . Some of the finite structures considered in graph theory have names, sometimes inspired by the graph's topology, and sometimes after their discoverer. A famous example is the Petersen graph, a concrete graph on 10 vertices that appears as a minimal example or counterexample in many different contexts.
File:Balaban 10-cage alternative drawing.svg|[[Balaban 10-cage]]
File:Balaban 11-cage.svg|[[Balaban 11-cage]]
File:Bidiakis cube.svg|[[Bidiakis cube]]
File:Brinkmann graph LS.svg|[[Brinkmann graph]]
File:Bull graph.circo.svg|[[Bull graph]]
File:Butterfly graph.svg|[[Butterfly graph]]
File:Chvatal graph.draw.svg|[[Chvátal graph]]
File:Diamond graph.svg|[[Diamond graph]]
File:Dürer graph.svg|[[Dürer graph]]
File:Ellingham-Horton 54-graph.svg|[[Ellingham–Horton 54-graph]]
File:Ellingham-Horton 78-graph.svg|[[Ellingham–Horton 78-graph]]
File:Errera graph.svg|[[Errera graph]]
File:Franklin graph.svg|[[Franklin graph]]
File:Frucht planar Lombardi.svg|[[Frucht graph]]
File:Goldner-Harary graph.svg|[[Goldner–Harary graph]]
File:GolombGraph.svg|[[Golomb graph]]
File:Groetzsch-graph.svg|[[Grötzsch graph]]
File:Harries graph alternative_drawing.svg|[[Harries graph]]
File:Harries-wong graph.svg|[[Harries–Wong graph]]
File:Herschel graph no col.svg|[[Herschel graph]]
File:Hoffman graph.svg|[[Hoffman graph]]
File:Holt graph.svg|[[Holt graph]]
File:Horton graph.svg|[[Horton graph]]
File:Kittell graph.svg|[[Kittell graph]]
File:Markström-Graph.svg|[[Erdős–Gyárfás conjecture|Markström graph]]
File:McGee graph.svg|[[McGee graph]]
File:Meredith graph.svg|[[Meredith graph]]
File:Moser spindle.svg |[[Moser spindle]]
File:Sousselier graph.svg|[[Sousselier graph]]
File:Poussin graph planar.svg|[[Poussin graph]]
File:Robertson graph.
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.
This partial list of graphs contains definitions of graphs and graph families. For collected definitions of graph theory terms that do not refer to individual graph types, such as vertex and path, see Glossary of graph theory. For links to existing articles about particular kinds of graphs, see . Some of the finite structures considered in graph theory have names, sometimes inspired by the graph's topology, and sometimes after their discoverer.
In graph theory, a branch of mathematics, many important families of graphs can be described by a finite set of individual graphs that do not belong to the family and further exclude all graphs from the family which contain any of these forbidden graphs as (induced) subgraph or minor. A prototypical example of this phenomenon is Kuratowski's theorem, which states that a graph is planar (can be drawn without crossings in the plane) if and only if it does not contain either of two forbidden graphs, the complete graph K_5 and the complete bipartite graph K_3,3.
In graph theory, the hypercube graph Q_n is the graph formed from the vertices and edges of an n-dimensional hypercube. For instance, the cube graph Q_3 is the graph formed by the 8 vertices and 12 edges of a three-dimensional cube. Q_n has 2^n vertices, 2^n – 1n edges, and is a regular graph with n edges touching each vertex. The hypercube graph Q_n may also be constructed by creating a vertex for each subset of an n-element set, with two vertices adjacent when their subsets differ in a single element, or by creating a vertex for each n-digit binary number, with two vertices adjacent when their binary representations differ in a single digit.
Study of structures and concepts that do not require the notion of continuity. Graph theory, or study of general countable sets are some of the areas that are covered by discrete mathematics. Emphasis
The class covers topics related to statistical inference and algorithms on graphs: basic random graphs concepts, thresholds, subgraph containment (planted clique), connectivity, broadcasting on trees,