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 Category:Graphs. 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.
This partial listofgraphs contains definitions ofgraphs and graph families. For collected definitions ofgraph theory terms that do not refer to individual...
undirected graphs, where edges link two vertices symmetrically, and directed graphs, where edges link two vertices asymmetrically. Graphs are one of the principal...
Appendix:Glossary ofgraph theory in Wiktionary, the free dictionary. This is a glossary ofgraph theory. Graph theory is the study ofgraphs, systems of nodes or...
Matthew; Chong, Eugene; Banerjee, Jay (2014-03-24). "A Tale of Two Graphs: Property Graphs as RDF in Oracle". {{cite journal}}: Cite journal requires |journal=...
A graphing calculator is a class of hand-held calculator that is capable of plotting graphs and solving complex functions. There are several companies...
adjacency list describes the set of neighbors of a particular vertex in the graph. This is one of several commonly used representations ofgraphs for use...
known: the complete graph K2, the Petersen graph, the Coxeter graph and two graphs derived from the Petersen and Coxeter graphs by replacing each vertex...
Look up Graph, graph, or -graph in Wiktionary, the free dictionary. Wikimedia Commons has media related to Graphs. Graph may refer to: Graph (discrete...
media related to Graphs by number of vertices. See also Graph theory for the general theory, as well as Gallery of named graphs for a list with illustrations...
This is a listofgraph theory topics, by Wikipedia page. See glossary ofgraph theory terms for basic terminology Amalgamation Bipartite graph Complete...
be called loop-digraphs (see section Types of directed graph). Symmetric directed graphs are directed graphs where all edges appear twice, one in each...
existence of Eulerian circuits is that all vertices in the graph have an even degree, and stated without proof that connected graphs with all vertices of even...
per target that features four graphs (GIF or PNG images). Results are plotted vs time into day, week, month and year graphs, with the I plotted as a full...
protein structures. Velvet: a set of algorithms manipulating de Bruijn graphs for genomic sequence assembly Sorting by signed reversals: an algorithm...
acyclic graphs are sometimes instead called acyclic directed graphs or acyclic digraphs. A graph is formed by vertices and by edges connecting pairs of vertices...
In mathematics, random graph is the general term to refer to probability distributions over graphs. Random graphs may be described simply by a probability...
2 ("The spectrum of a graph"), pp. 7–13. Brouwer, Andries E.; Haemers, Willem H. (2012), "1.3.6 Bipartite graphs", Spectra ofGraphs, Universitext, New...
graphs of subtrees of a tree. They are sometimes also called rigid circuit graphs or triangulated graphs: a chordal completion of a graph is typically called...
an "invariant". More formally, a graph property is a class ofgraphs with the property that any two isomorphic graphs either both belong to the class,...
In graph theory, an isomorphism ofgraphs G and H is a bijection between the vertex sets of G and H f : V ( G ) → V ( H ) {\displaystyle f\colon V(G)\to...
triangle-free graphs, and (2, 3)-choosability in bipartite planar graphs. For P5-free graphs, that is, graphs excluding a 5-vertex path graph, k-choosability...
signed graphs and gain graphs. Critical graphGraph coloring game Graph homomorphism Hajós construction Mathematics of Sudoku Multipartite graph Uniquely...
at least one of these two graphs as a subgraph (in which case it does not belong to the planar graphs). More generally, a forbidden graph characterization...
H-minor-free graphs have a separator theorem similar to the planar separator theorem for planar graphs: for any fixed H, and any n-vertex H-minor-free graph G,...
Trivial Graph Format (TGF) is a simple text-based adjacency list file format for describing graphs, widely used because of its simplicity. The format consists...
exactly what data it needs from an API. Instead of multiple endpoints that return separate data, a GraphQL server exposes a single endpoint and responds...