|
Klein Graphs
In the mathematics, mathematical field of graph theory, the Klein graphs are two different but related regular graphs, each with 84 edges. Each can be embedded in the orientable Surface (topology), surface of Surface (topology)#Classification_of_closed_surfaces, genus 3, in which they form dual graphs. The cubic Klein graph This is a 3-regular graph, regular (Cubic graph, cubic) graph with 56 vertices and 84 edges, named after Felix Klein. It is Hamiltonian graph, Hamiltonian, has chromatic number 3, chromatic index 3, radius 6, diameter 6 and girth (graph theory), girth 7. It is also a 3-k-vertex-connected graph, vertex-connected and a 3-k-edge-connected graph, edge-connected graph. It has book thickness 3 and queue number 2. It can be embedded in the Manifold#Genus_and_the_Euler_characteristic, genus-3 orientable Manifold, surface (which can be represented as the Klein quartic), where it forms the Klein map with 24 heptagonal faces, Schläfli symbol 8. According to the ''Fost ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Triple Torus Illustration
Triple is used in several contexts to mean "threefold" or a " treble": Sports * Triple (baseball), a three-base hit * A basketball three-point field goal * A figure skating jump with three rotations * In bowling terms, three strikes in a row * In cycling, a crankset with three chainrings Places * Triple Islands, an uninhabited island group in Nunavut, Canada * Triple Island, British Columbia, Canada * Triple Falls (other), four waterfalls in the United States & Canada * Triple Glaciers, in Grand Teton National Park, Wyoming * Triple Crossing, Richmond, Virginia, believed to be the only place in North America where three Class I railroads cross * Triple Bridge, a stone arch bridge in Ljubljana, Slovenia Transportation * Kawasaki triple, a Japanese motorcycle produced between 1969 and 1980 * Triumph Triple, a motorcycle engine from Triumph Motorcycles Ltd * A straight-three engine * A semi-truck with three trailers Science and technology * Triple (mathematics) (3-tuple), ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Book Thickness
In graph theory, a book embedding is a generalization of planar embedding of a graph to embeddings into a ''book'', a collection of half-planes all having the same line as their boundary. Usually, the vertices of the graph are required to lie on this boundary line, called the ''spine'', and the edges are required to stay within a single half-plane. The book thickness of a graph is the smallest possible number of half-planes for any book embedding of the graph. Book thickness is also called pagenumber, stacknumber or fixed outerthickness. Book embeddings have also been used to define several other graph invariants including the pagewidth and book crossing number. Every graph with vertices has book thickness at most \lceil n/2\rceil, and this formula gives the exact book thickness for complete graphs. The graphs with book thickness one are the outerplanar graphs. The graphs with book thickness at most two are the subhamiltonian graphs, which are always planar; more generally, ev ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Distance-regular Graph
In the mathematical field of graph theory, a distance-regular graph is a regular graph such that for any two vertices and , the number of vertices at distance from and at distance from depends only upon , , and the distance between and . Every distance-transitive graph is distance-regular. Indeed, distance-regular graphs were introduced as a combinatorial generalization of distance-transitive graphs, having the numerical regularity properties of the latter without necessarily having a large automorphism group. Intersection arrays It turns out that a graph G of diameter d is distance-regular if and only if there is an array of integers \ such that for all 1 \leq j \leq d , b_j gives the number of neighbours of u at distance j+1 from v and c_j gives the number of neighbours of u at distance j - 1 from v for any pair of vertices u and v at distance j on G . The array of integers characterizing a distance-regular graph is known as its intersection array. Cos ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Klein Quartic With Heptagons
Klein may refer to: People *Klein (surname) * Klein (musician) Places *Klein (crater), a lunar feature * Klein, Montana, United States *Klein, Texas, United States *Klein (Ohm), a river of Hesse, Germany, tributary of the Ohm *Klein River, a river in the Western Cape province of South Africa Business *Klein Bikes, a bicycle manufacturer *Klein Tools, a manufacturer *S. Klein, a department store *Klein Modellbahn, an Austrian model railway manufacturer Arts *Klein + M.B.O., an Italian musical group * Klein Award, for comic art *Yves Klein, French artist Mathematics * Klein bottle, an unusual shape in topology *Klein geometry *Klein configuration, in geometry * Klein cubic (other) *Klein graphs, in graph theory *Klein model, or Beltrami–Klein model, a model of hyperbolic geometry *Klein polyhedron, a generalization of continued fractions to higher dimensions, in the geometry of numbers *Klein surface, a dianalytic manifold of complex dimension 1 Other uses * Kleins, L ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Characteristic Polynomial
In linear algebra, the characteristic polynomial of a square matrix is a polynomial which is invariant under matrix similarity and has the eigenvalues as roots. It has the determinant and the trace of the matrix among its coefficients. The characteristic polynomial of an endomorphism of a finite-dimensional vector space is the characteristic polynomial of the matrix of that endomorphism over any base (that is, the characteristic polynomial does not depend on the choice of a basis). The characteristic equation, also known as the determinantal equation, is the equation obtained by equating the characteristic polynomial to zero. In spectral graph theory, the characteristic polynomial of a graph is the characteristic polynomial of its adjacency matrix. Motivation In linear algebra, eigenvalues and eigenvectors play a fundamental role, since, given a linear transformation, an eigenvector is a vector whose direction is not changed by the transformation, and the corresponding eigenva ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Symmetric Graph
In the mathematical field of graph theory, a graph is symmetric (or arc-transitive) if, given any two pairs of adjacent vertices and of , there is an automorphism :f : V(G) \rightarrow V(G) such that :f(u_1) = u_2 and f(v_1) = v_2. In other words, a graph is symmetric if its automorphism group acts transitively on ordered pairs of adjacent vertices (that is, upon edges considered as having a direction). Such a graph is sometimes also called -transitive or flag-transitive. By definition (ignoring and ), a symmetric graph without isolated vertices must also be vertex-transitive. Since the definition above maps one edge to another, a symmetric graph must also be edge-transitive. However, an edge-transitive graph need not be symmetric, since might map to , but not to . Star graphs are a simple example of being edge-transitive without being vertex-transitive or symmetric. As a further example, semi-symmetric graphs are edge-transitive and regular, but not vertex-transitiv ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
(2,3,7) Triangle Group
In the theory of Riemann surfaces and hyperbolic geometry, the triangle group (2,3,7) is particularly important. This importance stems from its connection to Hurwitz surfaces, namely Riemann surfaces of genus ''g'' with the largest possible order, 84(''g'' − 1), of its automorphism group. A note on terminology – the "(2,3,7) triangle group" most often refers, not to the ''full'' triangle group Δ(2,3,7) (the Coxeter group with Schwarz triangle (2,3,7) or a realization as a hyperbolic reflection group), but rather to the ''ordinary'' triangle group (the von Dyck group) ''D''(2,3,7) of orientation-preserving maps (the rotation group), which is index 2. Torsion-free normal subgroups of the (2,3,7) triangle group are Fuchsian groups associated with Hurwitz surfaces, such as the Klein quartic, Macbeath surface and First Hurwitz triplet. Constructions Hyperbolic construction To construct the triangle group, start with a hyperbolic triangle with angles π/2, π/3, and π/7. Thi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Coxeter Graph
In the mathematical field of graph theory, the Coxeter graph is a 3-regular graph with 28 vertices and 42 edges. It is one of the 13 known cubic distance-regular graphs. It is named after Harold Scott MacDonald Coxeter. Properties The Coxeter graph has chromatic number 3, chromatic index 3, radius 4, diameter 4 and girth 7. It is also a 3- vertex-connected graph and a 3- edge-connected graph. It has book thickness 3 and queue number 2. The Coxeter graph is hypohamiltonian: it does not itself have a Hamiltonian cycle but every graph formed by removing a single vertex from it is Hamiltonian. It has rectilinear crossing number 11, and is the smallest cubic graph with that crossing number . Construction The simplest construction of a Coxeter graph is from a Fano plane. Take the 7C3 = 35 possible 3-combinations on 7 objects. Discard the 7 triplets that correspond to the lines of the Fano plane, leaving 28 triplets. Link two triplets if they are disjoint. The result is the Coxete ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Bipartite Graph
In the mathematical field of graph theory, a bipartite graph (or bigraph) is a graph whose vertices can be divided into two disjoint and independent sets U and V, that is every edge connects a vertex in U to one in V. Vertex sets U and V are usually called the ''parts'' of the graph. Equivalently, a bipartite graph is a graph that does not contain any odd-length cycles. The two sets U and V may be thought of as a coloring of the graph with two colors: if one colors all nodes in U blue, and all nodes in V red, each edge has endpoints of differing colors, as is required in the graph coloring problem.. In contrast, such a coloring is impossible in the case of a non-bipartite graph, such as a triangle: after one node is colored blue and another red, the third vertex of the triangle is connected to vertices of both colors, preventing it from being assigned either color. One often writes G=(U,V,E) to denote a bipartite graph whose partition has the parts U and V, with E denoting ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Schläfli Symbol
In geometry, the Schläfli symbol is a notation of the form \ that defines regular polytopes and tessellations. The Schläfli symbol is named after the 19th-century Swiss mathematician Ludwig Schläfli, who generalized Euclidean geometry to more than three dimensions and discovered all their convex regular polytopes, including the six that occur in four dimensions. Definition The Schläfli symbol is a recursive description, starting with for a ''p''-sided regular polygon that is convex. For example, is an equilateral triangle, is a square, a convex regular pentagon, etc. Regular star polygons are not convex, and their Schläfli symbols contain irreducible fractions ''p''/''q'', where ''p'' is the number of vertices, and ''q'' is their turning number. Equivalently, is created from the vertices of , connected every ''q''. For example, is a pentagram; is a pentagon. A regular polyhedron that has ''q'' regular ''p''-sided Face (geometry), polygon faces around each Verte ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
