In mathematics, and more specifically in graph theory, a vertex (plural vertices) or node is the fundamental unit of which Graph 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).

## Bibliography

“Vertex (Graph Theory).” 2022.

*Wikipedia*, February. https://en.wikipedia.org/w/index.php?title=Vertex_(graph_theory)&oldid=1074286774.## Backlinks

- Adjacency matrix
- All-pairs shortest path problem
- B-tree
- Closure (Graph)
- Contraction hierarchies
- Customizable route planning
- Cycle (Graph theory)
- Depth-first search
- Dijkstra’s algorithm
- Directed acyclic graph
- Edge
- Forest
- Graph
- Graph theory
- Path (graph theory)
- Red-black tree
- Shortest path algorithm
- Single-pair shortest path problem
- Single-source shortest path problem
- Spanning tree
- Topological order
- Tree
- Tree rotation
- Trie
- Undirected graph
- Walk (Graph theory)
- Widest path problem