Use your lexicon to collect terms that you find interesting and define them the way you think they are correct.
a Type VIIC submarine of the Kriegsmarine that was captured and commissioned into the Royal Navy as HMS Graph (P715)![]()
are visual presentations on some surface, such as a wall, canvas, computer screen, paper, or stone to brand, inform, illustrate, or entertain![]()
an open source program that can generate two dimensional plots of mathematical functions and data sets![]()
In computer science, a graph is a kind of data structure, specifically an abstract data type (ADT), that consists of a set of nodes (also called vertices) and a set of edges that establish relationships (connections) between the nodes![]()
A graphic (such as a chart or diagram) depicting the relationship between two or more variables used, for instance, in visualising scientific data![]()
a chart with rectangular bars with lengths proportional to the values that they represent![]()
Furthermore, the term -graf occurs in various office titles which didn't attain nobiliary status, but were either held as a sinecure by nobleman or courtiers, or by those who remained functional officials, such as the Deichgraf (in a polder managemen![]()
In mathematics, the graph of a function f is the collection of all ordered pairs (x, f(x))![]()
The English suffix -graphy means either "writing" or a "field of study", and is an anglicization of the French -graphie inherited from the Latin -graphia, which is a transliterated direct borrowing from Greek![]()
In mathematics and computer science, graph theory is the study of graphs: mathematical structures used to model pairwise relations between objects from a certain collection![]()
In typography, a grapheme is the fundamental unit in written language![]()
views social relationships in terms of nodes and ties. Nodes are the individual actors within the networks, and ties are the relationships between the actors![]()
a directed, acyclic graph that represents a structural implementation of the logical functionality of a circuit or network![]()
Simple models of population growth include the Malthusian Growth Model and the logistic model![]()
a method of analysing the inter-visibility connections within buildings or urban networks![]()
an undirected graph that is edge-transitive and regular, but not vertex-transitive![]()
As the unique smallest cubic graph of girth 8 it is a cage and a Moore graph![]()
The length of the longest induced path in a graph has sometimes been called the detour number of the graph![]()
To facilitate use with logarithmic tables, one usually takes logs to base 10 or e: The term log-lin is used to describe a semi-log plot with a logarithmic scale on the y axis, and a linear scale on the x axis![]()
Any tournament on a finite number n of vertices contains a Hamiltonian path, i.e., directed path on all n vertices (Rédei 1934)![]()
The dual problem is a reformulation of a constraint satisfaction problem expressing each constraint of the original problem as a variable![]()
a graphical and theoretical approach to efficiently solving batch process scheduling problems in chemical plants![]()
a directed acyclic graph where each directed path is a stack![]()
In mathematics, a hypergraph is a generalization of a graph, where edges can connect any number of vertices![]()
In mathematics and computer science, graph theory is the study of graphs: mathematical structures used to model pairwise relations between objects from a certain collection![]()
In computer science, A* is a best-first, graph search algorithm that finds the least-cost path from a given initial node to one goal node (out of one or more possible goals)![]()
a graph which can be embedded in the plane, i.e., it can be drawn on the plane in such a way that its edges intersect only at their endpoints![]()
conceived by Dutch computer scientist Edsger Dijkstra in 1959, is a graph search algorithm that solves the single-source shortest path problem for a graph with non negative edge path costs, outputting a shortest path tree![]()
a notation for logic based on the existential graphs of Charles Sanders Peirce and the semantic networks of artificial intelligence![]()
a network (graph) with non-trivial topological features-features that do not occur in simple networks such as lattices or random graphs![]()
a sub-field of abstract algebra, a group cycle graph illustrates the various cycles of a group and is particularly useful in visualizing the structure of small finite groups![]()
states that given any plane separated into regions, such as a political map of the states of a country, the regions may be colored using no more than four colors in such a way that no two adjacent regions receive the same color![]()
Some of the finite structures considered in graph theory have names, sometimes inspired by the graph's topology, and sometimes after their discoverer![]()
and more specifically graph theory, a median graph is an undirected graph in which any three vertices a, b, and c have a unique median: a vertex m(a,b,c) that belongs to shortest paths between any two of a, b, and c![]()
a mathematical term related to percolation theory, which is the formation of long-range connectivity in random systems![]()
an algorithm in graph theory that finds a minimum spanning tree for a connected weighted graph![]()
states that in any colouring of the edges of a sufficiently large complete graph (that is, a simple graph in which an edge connects every pair of vertices), one will find monochromatic complete subgraphs![]()
Not satisfied with the result? If you know a little something about what you were searching for, please add the term to Factolex.