Vertex (graph theory)
Generated by GPT-5-miniExpansion Funnel Raw 66 → Dedup 3 → NER 2 → Enqueued 0
| Vertex (graph theory) | |
|---|---|
.png) AzaToth · Public domain · source | |
| Name | Vertex (graph theory) |
| Type | Concept |
| Field | Mathematics |
| Subfield | Graph theory |
| Related | Edge, Graph, Network, Node |
Vertex (graph theory)
A vertex is a fundamental unit in the mathematical theory of graphs, used to model pairwise relationships between objects. In graph-theoretic models, each vertex serves as an endpoint for edges that represent connections among entities; this concept appears throughout combinatorics, discrete mathematics, and computer science and underpins structures employed by institutions such as Microsoft, Google, IBM, NASA, and CERN in network analysis and algorithm design.
Definition and notation
A vertex (also called a node in many applied contexts) is an element of the vertex set V of a graph G = (V, E), where E denotes the edge set; this formalism is standard in texts from Paul Erdős-era combinatorics through modern treatments by László Lovász, Béla Bollobás, William Tutte, Frank Harary, and researchers at Institute for Advanced Study. Notation commonly uses v, u, w ∈ V, with edges written as unordered pairs {u,v} for simple undirected graphs or ordered pairs (u,v) in directed graphs; these conventions appear in expositions by Claude Shannon, Richard M. Karp, Edsger W. Dijkstra, and authors affiliated with Princeton University and Massachusetts Institute of Technology. Labeled graphs assign identifiers to vertices, a technique utilized in studies by Alan Turing-inspired computing researchers and in databases maintained by Wolfram Research.
Vertex properties and classifications
Vertices are classified by properties like isolated, pendant (degree one), cut-vertex (articulation point), and dominant (in domination theory), concepts treated by Kazimierz Kuratowski in planar graph criteria and by Hassler Whitney in connectivity theory. In planar graphs and embeddings studied by scholars at University of Cambridge, vertices contribute to Euler characteristic calculations alongside faces and edges, a relation first formalized in work connected to Leonhard Euler. Symmetry properties of vertices under graph automorphisms are central to algebraic graph theory explored by Issai Schur, Fritz Noether, Richard Brauer, and modern groups research at Princeton. Vertex transitivity, regularity, and orbit structure appear in treatments by Marston Morse and computational group theory teams such as those at Harvard University.
Degree and neighborhood
The degree deg(v) counts incident edges at vertex v in undirected graphs, while indegree and outdegree apply in directed networks; degree sequences and graphicality conditions were studied by Paul Erdős and Tibor Gallai and algorithmically addressed by Vera T. Sós and J. H. Conway collaborators. The neighborhood N(v) of a vertex comprises adjacent vertices and is central to clustering, local connectivity, and local search algorithms used by researchers at Stanford University, Carnegie Mellon University, and Bell Labs. The handshake lemma, a simple parity identity, links vertex degrees to the size of the edge set and is a staple in combinatorial proofs developed in seminars at University of Oxford and ETH Zurich.
Special vertices and operations
Special vertex types include articulation points, cut-vertices, hubs in scale-free networks analyzed by Albert-László Barabási, and centrality-defining vertices in studies by Duncan J. Watts and Steven Strogatz. Operations that modify vertices—splitting, contraction, deletion, and subdivision—feature prominently in reduction proofs by Paul Seymour and in algorithmic graph minor theory advanced by Neil Robertson and Sahin collaborators; vertex contraction is essential in formulations of the Four-Color Theorem proof and the theory of minors. Vertex cover and independent set problems focus on selecting subsets of vertices with combinatorial constraints, topics central to complexity theory as studied by Stephen Cook, Richard M. Karp, and groups at Bell Labs and AT&T.
Role in graph algorithms and applications
Vertices are primary elements in classical algorithms: breadth-first search and depth-first search explore vertices in orders analyzed by Robert Tarjan and Donald Knuth; shortest-path algorithms (Dijkstra, Bellman–Ford) compute vertex-to-vertex distances in transportation and routing systems used by FedEx, UPS, and Siemens. Vertex labeling underlies isomorphism testing, an area pursued by László Babai and research teams at IBM Research and Microsoft Research. In machine learning and network science, graph neural networks and vertex feature propagation techniques developed by researchers at Google DeepMind, Facebook AI Research, and OpenAI operate on vertex attributes for tasks in recommendation systems and bioinformatics studied at Broad Institute and Wellcome Sanger Institute.
Algebraic and topological perspectives
Algebraic graph theory links vertices to matrices—adjacency, Laplacian, and incidence matrices—an approach advanced by Dirichlet-inspired spectral theory and by authors such as Fan Chung, Daniel Spielman, and Noga Alon; eigenvectors associated with these matrices often localize on vertex sets and influence partitioning and clustering methods used at Bell Labs and Google. Topological graph theory studies embeddings of vertex-edge structures onto surfaces, a program associated with William Tutte and pursued at institutions like University of Toronto and University of Illinois. Sheaf-theoretic and homological methods relating vertices to simplicial complexes connect to algebraic topology developments linked to work at Institute for Advanced Study and École Normale Supérieure.