Connectivity (graph theory)In mathematics and computer science, connectivity is one of the basic concepts of graph theory: it asks for the minimum number of elements (nodes or edges) that need to be removed to separate the remaining nodes into two or more isolated subgraphs. It is closely related to the theory of network flow problems. The connectivity of a graph is an important measure of its resilience as a network. In an undirected graph G, two vertices u and v are called connected if G contains a path from u to v.
Geometric graph theoryGeometric graph theory in the broader sense is a large and amorphous subfield of graph theory, concerned with graphs defined by geometric means. In a stricter sense, geometric graph theory studies combinatorial and geometric properties of geometric graphs, meaning graphs drawn in the Euclidean plane with possibly intersecting straight-line edges, and topological graphs, where the edges are allowed to be arbitrary continuous curves connecting the vertices; thus, it can be described as "the theory of geometric and topological graphs" (Pach 2013).
Euler characteristicIn mathematics, and more specifically in algebraic topology and polyhedral combinatorics, the Euler characteristic (or Euler number, or Euler–Poincaré characteristic) is a topological invariant, a number that describes a topological space's shape or structure regardless of the way it is bent. It is commonly denoted by (Greek lower-case letter chi). The Euler characteristic was originally defined for polyhedra and used to prove various theorems about them, including the classification of the Platonic solids.
TricolorabilityIn the mathematical field of knot theory, the tricolorability of a knot is the ability of a knot to be colored with three colors subject to certain rules. Tricolorability is an isotopy invariant, and hence can be used to distinguish between two different (non-isotopic) knots. In particular, since the unknot is not tricolorable, any tricolorable knot is necessarily nontrivial. In these rules a strand in a knot diagram will be a piece of the string that goes from one undercrossing to the next.
Toroidal polyhedronIn geometry, a toroidal polyhedron is a polyhedron which is also a toroid (a g-holed torus), having a topological genus (g) of 1 or greater. Notable examples include the Császár and Szilassi polyhedra. Toroidal polyhedra are defined as collections of polygons that meet at their edges and vertices, forming a manifold as they do. That is, each edge should be shared by exactly two polygons, and at each vertex the edges and faces that meet at the vertex should be linked together in a single cycle of alternating edges and faces, the link of the vertex.
Möbius ladderIn graph theory, the Möbius ladder Mn, for even numbers n, is formed from an n-cycle by adding edges (called "rungs") connecting opposite pairs of vertices in the cycle. It is a cubic, circulant graph, so-named because (with the exception of M6 (the utility graph K3,3), Mn has exactly n/2 four-cycles which link together by their shared edges to form a topological Möbius strip. Möbius ladders were named and first studied by .
Spectral graph theoryIn mathematics, spectral graph theory is the study of the properties of a graph in relationship to the characteristic polynomial, eigenvalues, and eigenvectors of matrices associated with the graph, such as its adjacency matrix or Laplacian matrix. The adjacency matrix of a simple undirected graph is a real symmetric matrix and is therefore orthogonally diagonalizable; its eigenvalues are real algebraic integers. While the adjacency matrix depends on the vertex labeling, its spectrum is a graph invariant, although not a complete one.
Hyperbolic linkIn mathematics, a hyperbolic link is a link in the 3-sphere with complement that has a complete Riemannian metric of constant negative curvature, i.e. has a hyperbolic geometry. A hyperbolic knot is a hyperbolic link with one component. As a consequence of the work of William Thurston, it is known that every knot is precisely one of the following: hyperbolic, a torus knot, or a satellite knot. As a consequence, hyperbolic knots can be considered plentiful. A similar heuristic applies to hyperbolic links.
Characteristic classIn mathematics, a characteristic class is a way of associating to each principal bundle of X a cohomology class of X. The cohomology class measures the extent the bundle is "twisted" and whether it possesses sections. Characteristic classes are global invariants that measure the deviation of a local product structure from a global product structure. They are one of the unifying geometric concepts in algebraic topology, differential geometry, and algebraic geometry.
Solid torusIn mathematics, a solid torus is the topological space formed by sweeping a disk around a circle. It is homeomorphic to the Cartesian product of the disk and the circle, endowed with the product topology. A standard way to visualize a solid torus is as a toroid, embedded in 3-space. However, it should be distinguished from a torus, which has the same visual appearance: the torus is the two-dimensional space on the boundary of a toroid, while the solid torus includes also the compact interior space enclosed by the torus.
