In mathematics, and more specifically in Graph Theory, a graph is a structure amounting to a set of objects in which some pairs of the objects are in some sense “related”. The objects correspond to mathematical abstractions called Vertices (also called nodes or points) and each of the related pairs of vertices is called an Edge (also called link or line).

## Types

## Bibliography

“Graph (Discrete Mathematics).” 2022.

*Wikipedia*, June. https://en.wikipedia.org/w/index.php?title=Graph_(discrete_mathematics)&oldid=1093859772.## Backlinks

- Adjacency list
- Adjacency matrix
- Ali Kemal Sinop, Lisa Fawcett, Sreenivas Gollapudi, Kostas Kollias | Robust Routing Using Electrical Flows
- All-pairs shortest path problem
- Biconnected graph
- Breadth-first search
- Contraction hierarchies
- Cycle (Graph theory)
- Depth-first search
- Directed graph
- Forest
- Jarnik’s algorithm
- Planar graph
- Shortest path algorithm
- Single-pair shortest path problem
- Single-source shortest path problem
- Spanning tree
- Tree
- Undirected graph
- Vertex
- Widest path problem