In graph theory, an area of mathematics, common graphs belong to a branch of extremal graph theory concerning inequalities in homomorphism densities. Roughly...

In discrete mathematics, particularly in graph theory, a graph is a structure consisting of a set of objects where some pairs of the objects are in some...

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

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

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

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

graph has an Euler cycle if and only if every vertex has an even number of incident edges. The term Eulerian graph has two common meanings in graph theory...

Laplacian matrix of a graph corresponding to the signal. The Laplacian matrix is the easiest to define for a simple graph but more common in applications for...

adjacent vertices have λ common neighbours, and every two non-adjacent vertices have μ common neighbours. Such a strongly regular graph is denoted by srg(v...

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

graph theory, a graph product is a binary operation on graphs. Specifically, it is an operation that takes two graphs G1 and G2 and produces a graph H...

see Buluc et al. (2013). Two common examples of graph partitioning are minimum cut and maximum cut problems. Typically, graph partition problems fall under...

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

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 mathematics, particularly graph theory, and computer science, a directed acyclic graph (DAG) is a directed graph with no directed cycles. That is, it...

In graph theory, graph coloring is a methodic assignment of labels traditionally called "colors" to elements of a graph. The assignment is subject to certain...

A strongly regular graph is a regular graph where every adjacent pair of vertices has the same number l of neighbors in common, and every non-adjacent...

mathematical graph theory, the Higman–Sims graph is a 22-regular undirected graph with 100 vertices and 1100 edges. It is the unique strongly regular graph srg(100...

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

friendship graph Fn can be constructed by joining n copies of the cycle graph C3 with a common vertex, which becomes a universal vertex for the graph. By construction...

acyclic graph is formed by adding edges between all pairs of non-adjacent nodes that have a common child, and then making all edges in the graph undirected...

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

A scene graph is a general data structure commonly used by vector-based graphics editing applications and modern computer games, which arranges the logical...

a common graph representation in graph theory. It is different to an adjacency matrix, which encodes the relation of vertex-vertex pairs. In graph theory...

2 copies of the cycle graph C3 with a common vertex and is therefore isomorphic to the friendship graph F2. The butterfly graph has diameter 2 and girth 3...

In graph theory and computer science, an adjacency matrix is a square matrix used to represent a finite graph. The elements of the matrix indicate whether...

to define a common format for exchanging graph structure data. It uses an XML-based syntax and supports the entire range of possible graph structure constellations...

other neighbors in common, whether or not the pair of nodes is connected. The Shrikhande graph can be constructed as a Cayley graph. The vertex set is...

number of complete graphs. A common type of lattice graph (known under different names, such as grid graph or square grid graph) is the graph whose vertices...