discipline of graph theory, a graph labeling is the assignment of labels, traditionally represented by integers, to edges and/or vertices of a graph. Formally...

In graph theory, an edge-graceful labeling is a type of graph labeling for simple, connected graphs in which no two distinct edges connect the same two...

A graph which admits a graceful labeling is called a graceful graph. The name "graceful labeling" is due to Solomon W. Golomb; this type of labeling was...

vertices and the same arc label (note that this notion of a labeled graph is different from the notion given by the article graph labeling). Multidimensional...

the same color. Graph coloring is a special case of graph labeling. In its simplest form, it is a way of coloring the vertices of a graph such that no two...

theorem Girth Graph drawing Graph homomorphism Graph labeling Graceful labeling Graph partition Graph pebbling Graph property Graph reduction Graph-structured...

application of graph theory, where subsets of connected components are uniquely labeled based on a given heuristic. Connected-component labeling is not to...

or edges have labels. The terms vertex-labeled or edge-labeled may be used to specify which objects of a graph have labels. Graph labeling refers to several...

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

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

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

graph labeling", Electronic Journal of Combinatorics: DS6, doi:10.37236/27. Erdős, Paul; Rényi, Alfréd; Sós, Vera T. (1966), "On a problem of graph theory"...

not. The components of a graph can be constructed in linear time, and a special case of the problem, connected-component labeling, is a basic technique in...

representations such as particular labellings or drawings of the graph. While graph drawing and graph representation are valid topics in graph theory, in order to focus...

on the vertex labeling, its spectrum is a graph invariant, although not a complete one. Spectral graph theory is also concerned with graph parameters that...

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

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

specifically in graph theory, a vertex (plural vertices) or node is the fundamental unit of which graphs are formed: an undirected graph consists of a set...

sparse graphs, e.g., SAUCY processes some graphs with millions of vertices in mere seconds. However, BLISS and NAUTY can also produce Canonical Labeling, whereas...

a type of graph labeling called a friendly labeling. A friendly labeling of an n-vertex undirected graph G = (V,E) is defined to be an assignment of...

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

Intersection graphs An interval graph is the intersection graph of a set of line segments in the real line. It may be given an adjacency labeling scheme in...

science, a graph is an abstract data type that is meant to implement the undirected graph and directed graph concepts from the field of graph theory within...

dynamic survey of graph labeling" (PDF). Electronic Journal of Combinatorics. DS6: 1–58. MR 1668059. Weisstein, Eric W. "Windmill Graph". MathWorld. Koh...

vertex-classification algorithm produces a canonical labeling of a graph chosen uniformly at random from the set of all n-vertex graphs after only two refinement steps. Small...

and conversely if a labeling scheme exists then a universal graph may be constructed having a vertex for every possible label. In older mathematical...

computer science Can the graph isomorphism problem be solved in polynomial time? More unsolved problems in computer science The graph isomorphism problem is...

and a single edge. The 7-page book graph of this type provides an example of a graph with no harmonious labeling. A second type, which might be called...

Graph neural networks (GNN) are specialized artificial neural networks that are designed for tasks whose inputs are graphs. One prominent example is molecular...