Definition:Labeled Graph

This page has been identified as a candidate for refactoring of basic complexity. In particular: Split into sections, as there is more than one concept discussed here. Until this has been finished, please leave {{Refactor}} in the code. New contributors: Refactoring is a task which is expected to be undertaken by experienced editors only. Because of the underlying complexity of the work needed, it is recommended that you do not embark on a refactoring task until you have become familiar with the structural nature of pages of $\mathsf{Pr} \infty \mathsf{fWiki}$. To discuss this page in more detail, feel free to use the talk page. When this work has been completed, you may remove this instance of {{Refactor}} from the code.

Definition

A labeled graph is a graph whose vertices are each assigned an element from a set of symbols (letters, usually, but this is unimportant).

The important thing to note is that the vertices can be distinguished one from another.

Note that it is not necessary for all the vertices to be assigned different labels.

A vertex-colored graph can be considered as a labeled graph, in which the labels assigned are elements from a set of colors. In this context it is then rare that all vertices are required to be assigned different colors.

A graph which has no such labeling is called an unlabeled graph.