Graphs Vertices and Edges: Explained with Examples

A graph is a mathematical structure made of vertices (points, also called nodes) and edges (lines that join pairs of vertices). Each vertex stands for an object — a city, a person, a computer — and each edge stands for a relationship or connection between two of those objects, such as a road, a friendship, or a cable.

Graphs matter because the real world is made of connections. Once you sketch a situation as a graph, you can answer questions exactly instead of guessing: which city is reachable, who is most connected, or where a network would break.

Key Concepts

• Vertex: a single point, usually labelled v1, v2, … Plural: vertices.
• Edge: a connection between two vertices. An edge joining u and v is written {u, v}; the order does not matter.
• Adjacent vertices: two vertices joined by an edge; neighbours are a vertex's adjacent vertices.
• Loop: an edge joining a vertex to itself. Multiple edges: more than one edge between the same pair.
• Simple graph: a graph with no loops and no multiple edges.
• Order: the number of vertices, written n. Size: the number of edges, written m.
• Incidence: an edge is incident on the two vertices it joins.

How It Works

To model a situation, list the objects as vertices, then draw an edge between every directly connected pair. A flight map is a graph: cities are vertices and direct flights are edges. Questions like "can I reach every city from here?" are then answered by inspecting the vertices and edges instead of the messy original situation.

Worked Example

Four students form a friendship group: Aarav, Bina, Chetan, Diya. Friendships (edges) are: Aarav–Bina, Aarav–Chetan, Bina–Chetan, Bina–Diya, Chetan–Diya. The order n is 4 and the size m is 5. Bina's neighbours are Aarav, Chetan and Diya. Aarav and Diya are not adjacent, but they connect through Bina: the route Aarav–Bina–Diya uses two edges. Every vertex has at least one edge, so nobody is isolated.

Common Misconceptions

• "Graph" here is not an x–y plot. In graph theory a graph means vertices and edges, not axes and a curve. A bar chart or a plot of y = x² is a different, unrelated meaning of the word "graph".
• The positions of the dots do not matter. If you stretch, bend or rearrange the drawing without changing which vertices are joined, it is the same graph. Only the pattern of connections counts.
• Every pair of vertices need not be joined. Most real graphs are sparse. A friendship graph of a whole school has far fewer edges than the huge number of possible pairs.

Real-World Applications

• Social networks: users are vertices and friendships or follows are edges; this is how friend suggestions are computed.
• Road and flight maps: junctions and cities are vertices, roads and routes are edges, used for navigation and route planning.
• Computer networks: devices are vertices and cables or wireless links are edges, used to design reliable layouts.
• Chemistry: atoms are vertices and chemical bonds are edges, giving the standard drawing of every molecule.

A graph is just dots and lines, yet it is one of the most flexible models in mathematics. Learn to read vertices and edges, and tangled real situations become clean pictures you can reason about step by step.