Named graphs are a key concept of Semantic Web architecture in which a set of Resource Description Framework statements (a graph) are identified using...

Franklin graph Frucht graph Goldner–Harary graph Golomb graph Grötzsch graph Harries graph Harries–Wong graph Herschel graph Hoffman graph Holt graph Horton...

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

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

Graph Modeling Language (GML) is a hierarchical ASCII-based file format for describing graphs. It has been also named Graph Meta Language. A simple 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...

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

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

In graph theory, an Eulerian trail (or Eulerian path) is a trail in a finite graph that visits every edge exactly once (allowing for revisiting vertices)...

problems in graph theory. The Petersen graph is named after Julius Petersen, who in 1898 constructed it to be the smallest bridgeless cubic graph with no...

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 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 mathematics, a Cayley graph, also known as a Cayley color graph, Cayley diagram, group diagram, or color group, is a graph that encodes the abstract...

In the mathematical discipline of graph theory, a matching or independent edge set in an undirected graph is a set of edges without common vertices. In...

In the mathematical field of graph theory, a graph G is symmetric (or arc-transitive) if, given any two pairs of adjacent vertices u1—v1 and u2—v2 of...

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

mathematical field of graph theory, the Heawood graph is an undirected graph with 14 vertices and 21 edges, named after Percy John Heawood. The graph is cubic, and...

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

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

discrete Laplacian, is a matrix representation of a graph. Named after Pierre-Simon Laplace, the graph Laplacian matrix can be viewed as a matrix form of...

content is always UTF-8. TriG RDF syntax extends Turtle with support for named graphs. N-Triples Notation3 (N3) LV2 "RDF 1.1 Turtle - Terse RDF Triple LanguageTurtle"...

In the mathematical field of graph theory, a complete graph is a simple undirected graph in which every pair of distinct vertices is connected by a unique...

In the mathematical theory of directed graphs, a graph is said to be strongly connected if every vertex is reachable from every other vertex. The strongly...

GraphQL is a data query and manipulation language for APIs that allows a client to specify what data it needs ("declarative data fetching"). A GraphQL...

interfaces and tools which enable developers to integrate with the open "social graph" of personal relations and other things like songs, places, and Facebook...

the mathematical field of graph theory, the Meringer graph is a 5-regular undirected graph with 30 vertices and 75 edges named after Markus Meringer. It...

Paley graphs form an infinite family of conference graphs, which yield an infinite family of symmetric conference matrices. Paley graphs allow graph-theoretic...

the mathematical field of graph theory, a Hamiltonian path (or traceable path) is a path in an undirected or directed graph that visits each vertex exactly...

mathematics, Johnson graphs are a special class of undirected graphs defined from systems of sets. The vertices of the Johnson graph J ( n , k ) {\displaystyle...