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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

 3). Several theorems relate properties of the spectrum to other graph properties. As a simple example, a connected graph with diameter D will have at...

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 the study of graph algorithms, an implicit graph representation (or more simply implicit graph) is a graph whose vertices or edges are not represented...

mathematical fields of graph theory and finite model theory, the logic of graphs deals with formal specifications of graph properties using sentences of mathematical...

analysis, the closed graph theorem is a result connecting the continuity of a linear operator to a topological property of their graph. Precisely, the theorem...

the graph is through such tests. Richard M. Karp conjectured that every randomized algorithm for every nontrivial monotone graph property (a property that...

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

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

there are an odd number of such graphs on any even number of vertices. This, in turn, can be used to show that the property of having a universal vertex...