Explore: Graph Labelings

of vertices may be connected by several labeled edges. Most graph labelings trace their origins to labelings presented by Alexander Rosa in his 1967 paper

vertex to itself. Edge-graceful labelings were first introduced by Sheng-Ping Lo in his seminal paper. Given a graph G, we denote the set of its edges

In graph theory, a tree is an undirected graph in which every pair of distinct vertices is connected by exactly one path, or equivalently, a connected

originally given the name β-labeling by Alexander Rosa in a 1967 paper on graph labelings. A major open problem in graph theory is the graceful tree conjecture

structures of graphs themselves from properties associated with graph representations: graph drawings, data structures for graphs, graph labelings, etc. For

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

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

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

form of a graph may also be described as a permutation of its vertices. Canonical forms of a graph are also called canonical labelings, and graph canonization

are labeled with the kinds of the corresponding atoms and edges are labeled with the types of bonds. For particular purposes any of the labelings may