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...

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

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

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...

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...

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...

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...

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

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...

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...

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...

context. These properties are particularly considered in topology and graph theory, but also in set theory. In topology, a topological property is said to...

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...

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...

a graph database model, that is basically characterized by three properties: data structures are graphs or any other structure similar to a graph; data...

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

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

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...

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 graph theory, an intersection graph is a graph that represents the pattern of intersections of a family of sets. Any graph can be represented as an...

In graph theory, a circulant graph is an undirected graph acted on by a cyclic group of symmetries which takes any vertex to any other vertex. It is sometimes...

In the mathematical field of graph theory, a distance-regular graph is a regular graph such that for any two vertices v and w, the number of vertices...

mathematical field of graph theory, the term "null graph" may refer either to the order-zero graph, or alternatively, to any edgeless graph (the latter is sometimes...