undirected graph

undirected graph is a mathematical structure consisting of a set of elements called vertices connected pairwise by edges that have no orientation. It serves as a foundational object in Leonhard Euler's analysis of the Seven Bridges of Königsberg and appears throughout work by Arthur Cayley, Gustav Kirchhoff, Dénes Kőnig, and Paul Erdős. Undirected graphs underpin modern developments in combinatorics, algorithms, and network science studied at institutions such as University of Cambridge, Princeton University, and Massachusetts Institute of Technology.

Definition and basic concepts

An undirected graph is formally a pair (V, E) where V is a set of vertices and E is a set of unordered pairs of distinct vertices; early formalism can be traced to Leonhard Euler's correspondence and later exposition by Dénes Kőnig and Kazimierz Kuratowski. Key basic notions include degree of a vertex, path, cycle, connected component, and adjacency; these definitions appear in textbooks by Paul Erdős, Ronald Graham, Richard Stanley, and Miklós Simonovits. Variations and notation are standardized in the literature of International Mathematical Union-sponsored conferences and texts used at Harvard University, Stanford University, and Columbia University. Terminology such as simple graph, multigraph, and loop originates in the historical work of William Rowan Hamilton and subsequent compilations by Frank Harary.

Properties and invariants

Important invariants include degree sequence, connectedness, diameter, girth, chromatic number, independence number, matching number, and spectrum of the adjacency matrix — topics explored by Erdős–Rényi researchers and in monographs by Fan Chung and László Lovász. Classical theorems such as Euler's formula for planar graphs, Kuratowski's theorem, Turán's theorem, and Brooks' theorem relate structure to invariants; contributors include Kuratowski, Pál Turán, R.L. Brooks, and Kazimierz Kuratowski. Algebraic properties involving the Laplacian matrix connect to work by Gustav Kirchhoff and later spectral graph theory by William Tutte and Noga Alon. Extremal results investigated by Paul Erdős, Andrásfai, and Tibor Gallai yield bounds on invariants under structural constraints; probabilistic methods introduced by Erdős and Alfréd Rényi provide average-case analyses.

Types and classes

Classes of undirected graphs include simple graphs, multigraphs, pseudographs, complete graphs, bipartite graphs, planar graphs, trees, forests, cacti, chordal graphs, interval graphs, comparability graphs, split graphs, regular graphs, and strongly regular graphs; classic examples and structural characterizations are found in works by Harary, Henry John Stephen Smith, Kuratowski, Tibor Gallai, and Seymour's collaborators. Random graph models such as the Erdős–Rényi model, configuration model, and preferential attachment variants have been developed and applied by researchers at Institute for Advanced Study, Princeton University, and University of Chicago. Special families like Cayley graphs, Johnson graphs, Kneser graphs, Paley graphs, and de Bruijn graphs relate to algebraic combinatorics and number theory studies by Arthur Cayley, Jack Edmonds, Lovász, and Claude Shannon.

Algorithms and computational problems

Central algorithmic tasks include traversal (depth-first search, breadth-first search), shortest paths (Dijkstra, Bellman–Ford for weighted variants), minimum spanning trees (Kruskal, Prim), maximum matching (Edmonds' blossom algorithm), graph coloring, planarity testing, community detection, and subgraph isomorphism; foundational algorithm designers include Robert Tarjan, Donald Knuth, Jack Edmonds, Kruskal, and Robert Prim. Complexity classifications such as P, NP, NP-complete, and fixed-parameter tractability involve seminal contributions from Stephen Cook, Richard Karp, Vera T. Sós, and Michael R. Garey; specific problems like Hamiltonian cycle and clique remain central in computational complexity research pursued at Stanford University and Carnegie Mellon University. Parallel, streaming, and distributed algorithms for massive graphs are active areas at Google, Facebook, Microsoft Research, and in academic groups led by Leslie Valiant and Shafi Goldwasser.

Applications and examples

Undirected graphs model relationships in chemistry (molecular graphs studied by Linus Pauling and Dorothy Crowfoot Hodgkin), sociology (social networks analyzed by Stanley Milgram and Mark Granovetter), biology (protein–protein interaction networks at Howard Hughes Medical Institute labs and Max Planck Institute groups), transportation (rail and road networks in studies involving Isambard Kingdom Brunel-era engineering), and electrical circuits (via Gustav Kirchhoff's laws). Examples include the Petersen graph, Platonic and Archimedean solids' graphs studied by Leonhard Euler and Arthur Cayley, molecular graphs for organic compounds analyzed by August Kekulé, and road maps of cities like London and Paris that appear in urban planning literature from Jane Jacobs. Algorithmic applications power search and recommendation systems at Amazon, Netflix, and Twitter and underpin cryptographic constructions explored by Whitfield Diffie and Ronald Rivest.

Category:Graph theory