# Node-Labeled Graph

Jump to navigation
Jump to search

A Node-Labeled Graph is a 2-Tuple consisting of a Graph, and a Node-Labeling Function.

**AKA:**Vertex-Labeled Graph.**Context:**- It can have a Labeled Graph Node.

**See:**Edge-Labeled Graph.

## References

### 2009

- http://en.wikipedia.org/w/index.php?title=Graph_labeling&action=edit
- Formally, given a graph G:=(V,E) with [math]\displaystyle{ V }[/math] being the set of vertices and $E$ being the set of edges, a
**vertex labeling**is a function from some subset of the integers to the vertices of the graph. A graph with such a function defined is called a**vertex-labeled graph**. Likewise, an**edge labeling**is a function from some subset of the integers to the edges of the graph, which is likewise called an**edge-labeled graph**.

- Formally, given a graph G:=(V,E) with [math]\displaystyle{ V }[/math] being the set of vertices and $E$ being the set of edges, a