An undirected graph is a set of nodes connected by edges, where each edge is bidirectional, meaning there is no inherent direction from one node to another. This type of graph is often used to model relationships where mutual connections are important, such as social networks or undirected pathways in network topology.