Related Experiment Video
Updated: Aug 15, 2026

Spatial Separation of Molecular Conformers and Clusters
Published on: January 9, 2014
Clustering analysis of the ground-state structure of the vertex-cover problem
Wolfgang Barthel1, Alexander K Hartmann
1Institut für Theoretische Physik, Universität Göttingen, Friedrich-Hund-Platz 1, D-37077 Göttingen, Germany.
Abstract:
Vertex cover is one of the classical NP-complete problems in theoretical computer science. A vertex cover of a graph is a subset of vertices such that for each edge at least one of the two endpoints is contained in the subset. When studied on Erdo s-Re nyi random graphs (with connectivity c) one observes a threshold behavior: In the thermodynamic limit the size of the minimal vertex cover is independent of the specific graph. Recent analytical studies show that on the phase boundary, for small connectivities c
More Related Videos
Related Concept Videos
VSEPR Theory and the Basic Shapes
Predicting Molecular Geometry
Crystal Field Theory - Tetrahedral and Square Planar Complexes
Crystal field theory (CFT) is applicable to molecules in geometries other than octahedral. In octahedral complexes, the lobes of the dx2−y2 and dz2 orbitals point directly at the ligands. For tetrahedral complexes, the d orbitals remain in place, but with only four ligands located between the axes. None of the orbitals points directly at the tetrahedral ligands. However, the dx2−y2 and dz2 orbitals (along the Cartesian axes) overlap with the ligands less than the dxy,...
VSEPR Theory
Vector Algebra: Graphical Method
We use the laws of geometry to construct resultant vectors, followed by trigonometry to find vector magnitudes and directions. For a geometric construction of the sum of two vectors in a plane, we follow the parallelogram rule. Suppose two vectors are at arbitrary positions. Translate either one of...
Vector Forms of Green’s Theorem

