A property graph, labeled property graph, or attributed graph is a data model of various graph-oriented databases, where pairs of entities are associated...

In graph theory, a graph property or graph invariant is a property of graphs that depends only on the abstract structure, not on graph representations...

GQL (Graph Query Language) is a standardized query language for property graphs first described in ISO/IEC 39075, released in April 2024 by ISO/IEC. The...

property graph (CPG) is a computer program representation that captures syntactic structure, control flow, and data dependencies in a property graph....

A graph database (GDB) is a database that uses graph structures for semantic queries with nodes, edges, and properties to represent and store data. A key...

grouped into three main areas: Property graph queries, a graph query language built on top of SQL The new part 16, “Property Graph Queries (SQL/PGQ)”, has been...

topology, closed graph is a property of functions. A function f : X → Y between topological spaces has a closed graph if its graph is a closed subset...

Appendix:Glossary of graph theory in Wiktionary, the free dictionary. This is a glossary of graph theory. Graph theory is the study of graphs, systems of nodes...

Cypher is a declarative graph query language that allows for expressive and efficient data querying in a property graph. Cypher was largely an invention...

particular property of the graph is likely to arise. Different random graph models produce different probability distributions on graphs. Most commonly...

computer science, graph theory is the study of graphs, which are mathematical structures used to model pairwise relations between objects. A graph in this context...

functional graph properties. Kirchhoff's theorem can be used to calculate the number of spanning trees for a given graph. The sparsest cut of a graph can be approximated...

connected graph G can be recovered completely from its line graph. Many other properties of line graphs follow by translating the properties of the underlying...

vertices and edges Graph theory, the study of such graphs and their properties Graph (topology), a topological space resembling a graph in the sense of discrete...

existence of graphs satisfying various properties, or to provide a rigorous definition of what it means for a property to hold for almost all graphs. There...

In graph theory, an expander graph is a sparse graph that has strong connectivity properties, quantified using vertex, edge or spectral expansion. Expander...

embedding of the graph G, so it is a property of plane graphs (graphs that are already embedded in the plane) rather than planar graphs (graphs that may be...

Bivariegated graph Cage (graph theory) Cayley graph Circle graph Clique graph Cograph Common graph Complement of a graph Complete graph Cubic graph Cycle graph De...

In graph theory, a planar graph is a graph that can be embedded in the plane, i.e., it can be drawn on the plane in such a way that its edges intersect...

In the mathematical field of graph theory, the Rado graph, Erdős–Rényi graph, or random graph is a countably infinite graph that can be constructed (with...

knowledge graph is a knowledge base that uses a graph-structured data model or topology to represent and operate on data. Knowledge graphs are often used...

the problem. Typically, property testing algorithms are used to determine whether some combinatorial structure S (such as a graph or a boolean function)...

every graph property preserved by deletions and contractions may be recognized in polynomial time. Other results and conjectures involving graph minors...

Graph neural networks (GNN) are specialized artificial neural networks that are designed for tasks whose inputs are graphs. One prominent example is molecular...

In essence, extremal graph theory studies how global properties of a graph influence local substructure. Results in extremal graph theory deal with quantitative...

In mathematics, spectral graph theory is the study of the properties of a graph in relationship to the characteristic polynomial, eigenvalues, and eigenvectors...

In mathematics, and more specifically in graph theory, a directed graph (or digraph) is a graph that is made up of a set of vertices connected by directed...

flow graph, and the exit block, through which all control flow leaves. Because of its construction procedure, in a CFG, every edge A→B has the property that:...

directed graph, each edge has an orientation, from one vertex to another vertex. A path in a directed graph is a sequence of edges having the property that...

nontrivial symmetries. Formally, an automorphism of a graph is a permutation p of its vertices with the property that any two vertices u and v are adjacent if...