Graph theory
Graph theory studies relationships as points connected by lines, turning networks, routes, dependencies, and choices into mathematical objects that can be analyzed.
What graph theory studies
Graph theory is a branch of mathematics about objects and their relationships. The objects are drawn as vertices, and the relationships are drawn as edges. The drawing is only a picture; the mathematical graph is the connection pattern itself, which means the same graph can be sketched in many different ways without changing its structure.
Vertices and edges
Vertices can stand for cities, people, web pages, tasks, atoms, or abstract states. Edges say which pairs are connected. Some graphs are undirected, where an edge simply links two vertices, while directed graphs use arrows to show one-way relationships such as links between pages or dependencies between tasks.
Paths, cycles, and connectivity
A path follows edges from one vertex to another. A cycle starts and ends at the same vertex without treating the trip as a simple backtrack. Connectivity asks whether every part of a graph can be reached from every other part, or whether the graph breaks into separate components. These ideas make it possible to reason about navigation, robustness, and bottlenecks.
Trees and sparse structure
A tree is a connected graph with no cycles. Trees are useful because they show the minimum kind of connected structure: enough edges to hold the vertices together, but no redundant loop. This makes them important in data structures, file systems, phylogenetic diagrams, electrical networks, and algorithms that choose efficient routes or dependencies.
Planar graphs and maps
A planar graph can be drawn on a flat surface without edges crossing except at vertices. This idea links graph theory to maps, circuit layout, and the famous four color theorem, which says that four colors are enough to color any planar map so neighboring regions have different colors. Planarity shows how geometry and connection structure can constrain each other.
Graph algorithms
Many practical uses of graph theory depend on algorithms. Breadth-first search explores a graph level by level, depth-first search follows paths deeply before backtracking, shortest-path algorithms find efficient routes, and matching or flow algorithms optimize pairings and movement through a network. The same mathematical language can describe both a subway map and a software dependency graph.
Networks in the real world
Modern network science uses graph ideas to study systems with many interacting parts. A vertex may be a person, airport, protein, server, or research paper; an edge may be a friendship, flight route, chemical interaction, data connection, or citation. Measures such as degree, centrality, clustering, and community structure help describe how influence or failure can move through a system.
Why it matters
Graph theory gives a compact way to study complexity without tracking every physical detail. It helps engineers design networks, computer scientists reason about data and algorithms, biologists model interactions, planners study routes, and security teams think about vulnerabilities. Its power comes from separating the pattern of connections from the many things those connections can represent.