the two-graph. A regular two-graph has the property that every pair of vertices lies in the same number of triples of the two-graph. Two-graphs have...

A two-dimensional graph may refer to The graph of a function of one variable A planar graph A diagram in a plane This disambiguation page lists mathematics...

graph theory, graph coloring is a special case of graph labeling; it is an assignment of labels traditionally called "colors" to elements of a graph subject...

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

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

In discrete mathematics, and more specifically in graph theory, a graph is a structure amounting to a set of objects in which some pairs of the objects...

of graph theory, graph operations are operations which produce new graphs from initial ones. They include both unary (one input) and binary (two input)...

In mathematics, the graph of a function f {\displaystyle f} is the set of ordered pairs ( x , y ) {\displaystyle (x,y)} , where f ( x ) = y . {\displaystyle...

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

In mathematics, particularly graph theory, and computer science, a directed acyclic graph (DAG) is a directed graph with no directed cycles. That is, it...

In the mathematical field of graph theory, a bipartite graph (or bigraph) is a graph whose vertices can be divided into two disjoint and independent sets...

In graph theory, an isomorphism of graphs G and H is a bijection between the vertex sets of G and H f : V ( G ) → V ( H ) {\displaystyle f\colon V(G)\to...

In the mathematical discipline of graph theory, the line graph of an undirected graph G is another graph L(G) that represents the adjacencies between edges...

In structure mining, a graph kernel is a kernel function that computes an inner product on graphs. Graph kernels can be intuitively understood as functions...

mathematical field of graph theory, the Petersen graph is an undirected graph with 10 vertices and 15 edges. It is a small graph that serves as a useful...

mathematical area of graph theory, a clique (/ˈkliːk/ or /ˈklɪk/) is a subset of vertices of an undirected graph such that every two distinct vertices in...

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

The Two Graphs is a 1950 detective novel by John Rhode, the pen name of the British writer Cecil Street. It is the fiftieth in his long-running series...

concepts of graph theory: it asks for the minimum number of elements (nodes or edges) that need to be removed to separate the remaining nodes into two or more...

A connected graph has an Euler cycle if and only if every vertex has even degree. The term Eulerian graph has two common meanings in graph theory. One...

Graph matching is the problem of finding a similarity between graphs. Graphs are commonly used to encode structural information in many fields, including...

GQL (Graph Query Language) is a standard graph query language published by ISO in April 2024. The GQL project is the culmination of converging initiatives...

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

In the mathematical field of graph theory, a graph homomorphism is a mapping between two graphs that respects their structure. More concretely, it is a...

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

In graph theory, a tree is an undirected graph in which any two vertices are connected by exactly one path, or equivalently a connected acyclic undirected...

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

In graph theory, the degree (or valency) of a vertex of a graph is the number of edges that are incident to the vertex; in a multigraph, a loop contributes...

mathematics, computer science and digital electronics, a dependency graph is a directed graph representing dependencies of several objects towards each other...

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