InfiniteGraph is a distributed graph database implemented in Java and C++ and is from a class of NOSQL ("Not Only SQL") database technologies that focus...

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

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

finite graphs either do not extend to the infinite case or need a rather different proof. An empty graph is a graph that has an empty set of vertices (and...

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

the infinite graph, as in "an 8 × 8 square grid". The term lattice graph has also been given in the literature to various other kinds of graphs with...

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

especially in the context of infinite graphs. All depth-first search trees and all Hamiltonian paths are Trémaux trees. In finite graphs, every Trémaux tree is...

In the mathematics of infinite graphs, an end of an undirected graph represents, intuitively, a direction in which the graph extends to infinity. Ends...

In graph theory, the De Bruijn–Erdős theorem relates graph coloring of an infinite graph to the same problem on its finite subgraphs. It states that,...

databases use a single data structure—such as key–value pairs, wide columns, graphs, or documents—to hold information. Since this non-relational design does...

theorem in graph theory due to the Hungarian mathematician Dénes Kőnig who published it in 1927. It gives a sufficient condition for an infinite graph to have...

infinite form of Ramsey's theorem for graphs, the Erdős–Dushnik–Miller theorem, states that every infinite graph contains either a countably infinite...

mathematician specializing in graph theory, including the interplay among graph minors, matroid theory, tree decomposition, and infinite graphs. He holds the chair...

"AllegroGraph Client Downloads". Fernandes, Diogo; Bernardino, Jorge (2018). "Graph Databases Comparison: AllegroGraph, ArangoDB, InfiniteGraph, Neo4J...

In graph theory, the handshaking lemma is the statement that, in every finite undirected graph, the number of vertices that touch an odd number of edges...

In the mathematical discipline of graph theory, Menger's theorem says that in a finite graph, the size of a minimum cut set is equal to the maximum number...

graphs, and characterizing the ends and clique minors of infinite graphs. If G is an undirected graph, and X is a set of vertices, then an X-flap is a nonempty...

of graph theory, a spanning tree T of an undirected graph G is a subgraph that is a tree which includes all of the vertices of G. In general, a graph may...

cubic graphs is the twelve-vertex Frucht graph discovered in 1939. According to a strengthened version of Frucht's theorem, there are infinitely many asymmetric...

finite planar graphs, but also to infinite graphs that can be drawn without crossings in the plane, and even more generally to infinite graphs (possibly with...

to disconnected graphs, and can be generalized to infinite graphs in which every vertex has finite degree. If a countably infinite graph G has no odd-degree...

the application of graph traversal methods in artificial intelligence the input may be an implicit representation of an infinite graph. In this context...

an algorithm for finding the shortest paths between nodes in a weighted graph, which may represent, for example, a road network. It was conceived by computer...

finite undirected graph. More strongly, for any finite group G there exist infinitely many non-isomorphic simple connected graphs such that the automorphism...

In graph theory, a path in a graph is a finite or infinite sequence of edges which joins a sequence of vertices which, by most definitions, are all distinct...

K6-minor-free graph is an apex graph Does a Moore graph with girth 5 and degree 57 exist? Do there exist infinitely many strongly regular geodetic graphs, or any...

are not true (or are rather different) for infinite graphs because many of the arguments fail in the infinite case. Moreover, V {\displaystyle V} is often...

and is a subgraph of the given graph. However, uniqueness fails for graphs with (directed) cycles, and for infinite graphs not even existence is guaranteed...

concept of graph density defined above from finite graphs to infinite graphs. Intuitively, an infinite graph has arbitrarily large finite subgraphs with any...