# Graph Node

(Redirected from graph node)

Jump to navigation
Jump to search
A Graph Node is a node of a graph.

**AKA:**Network Vertex.**Context:**- It can be in an Edge Relation with another Graph Node.
- It can have a Graph Node Attribute.
- It can range from being a Labeled Graph Node to being an Unlabeled Graph Node, depending on whether it has a Graph Node Attribute with a Value.
- It can be a member of a Graph Node Set.
- …

**Example(s):**- a Taxonomy Node.
- …

**Counter-Example(s):**- a Graph Edge.

**See:**Graph Node Pair, Graph-Node Prediction Task, Semantic Network, Neighborhood (Graph Theory), Subgraph.

## References

### 2014

- (Wikipedia, 2014) ⇒ http://en.wikipedia.org/wiki/Vertex_(graph_theory) Retrieved:2014-11-24.
- In mathematics, and more 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 of vertices and a set of edges (unordered pairs of vertices), while a directed graph consists of a set of vertices and a set of arcs (ordered pairs of vertices). In a diagram of a graph, a vertex is usually represented by a circle with a label, and an edge is represented by a line or arrow extending from one vertex to another.From the point of view of graph theory, vertices are treated as featureless and indivisible objects, although they may have additional structure depending on the application from which the graph arises; for instance, a semantic network is a graph in which the vertices represent concepts or classes of objects.

The two vertices forming an edge are said to be the endpoints of this edge, and the edge is said to be incident to the vertices. A vertex

*w*is said to be adjacent to another vertex*v*if the graph contains an edge (*v*,*w*). The neighborhood of a vertex*v*is an induced subgraph of the graph, formed by all vertices adjacent to*v*.

- In mathematics, and more specifically in graph theory, a