Graph databases differ from graph compute engines. Graph databases are a powerful tool for graph-like queries. Graphs are the basic subject studied by graph theory. The complete graph on vertices is denoted by . Each list describes the set of neighbors of a vertex in the graph. The traditional model is the random geometric graph. This forms the basis of many algorithms for graph coloring. Let formula 9 be a graph with formula 10 vertices. Let formula 3 be a graph with formula 4 vertices. Every finite connected graph has a spanning tree. Here is a simple example of a labelled, undirected graph and its Laplacian matrix. Reverse postordering produces a topological sorting of any directed acyclic graph. Individual securities are plotted on the SML graph. Refer to the glossary of graph theory for basic definitions in graph theory. For example, computing the shortest path between two nodes in the graph.