|
Rook's Graph
In graph theory, a rook's graph is a graph that represents all legal moves of the rook chess piece on a chessboard. Each vertex of a rook's graph represents a square on a chessboard, and each edge connects two squares on the same row (rank) or on the same column (file) as each other, the squares that a rook can move between. These graphs can be constructed for chessboards of any rectangular shape, and can be defined mathematically as the Cartesian product of two complete graphs, as the two-dimensional Hamming graphs, or as the line graphs of complete bipartite graphs. Rook's graphs are highly symmetric, having symmetries taking every vertex to every other vertex. In rook's graphs defined from square chessboards, more strongly, every two edges are symmetric, and every pair of vertices is symmetric to every other pair at the same distance (they are distance-transitive). For chessboards with relatively prime dimensions, they are circulant graphs. With one exception, they can be dist ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Integral Graph
In the mathematical field of graph theory, an integral graph is a graph whose adjacency matrix's spectrum consists entirely of integers. In other words, a graph is an integral graph if all of the roots of the characteristic polynomial of its adjacency matrix are integers. The notion was introduced in 1974 by Frank Harary and Allen Schwenk. Examples *The complete graph ''Kn'' is integral for all ''n''. *The only cycle graphs that are integral are C_3, C_4, and C_6. *If a graph is integral, then so is its complement graph; for instance, the complements of complete graphs, edgeless graphs, are integral. If two graphs are integral, then so is their Cartesian product and strong product; for instance, the Cartesian products of two complete graphs, the rook's graphs, are integral. Similarly, the hypercube graphs, as Cartesian products of any number of complete graphs K_2, are integral. *The line graph of an integral graph is again integral. For instance, as the line graph of K_4, the o ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Graph Coloring
In graph theory, graph coloring is a special case of graph labeling; it is an assignment of labels traditionally called "colors" to elements of a graph subject to certain constraints. In its simplest form, it is a way of coloring the vertices of a graph such that no two adjacent vertices are of the same color; this is called a vertex coloring. Similarly, an edge coloring assigns a color to each edge so that no two adjacent edges are of the same color, and a face coloring of a planar graph assigns a color to each face or region so that no two faces that share a boundary have the same color. Vertex coloring is often used to introduce graph coloring problems, since other coloring problems can be transformed into a vertex coloring instance. For example, an edge coloring of a graph is just a vertex coloring of its line graph, and a face coloring of a plane graph is just a vertex coloring of its dual. However, non-vertex coloring problems are often stated and studied as-is. This is ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
3-3 Duoprism
In the geometry of 4 dimensions, the 3-3 duoprism or triangular duoprism is a 4-polytope, four-dimensional convex polytope. It can be constructed as the Cartesian product of two triangles and is the simplest of an infinite family of four-dimensional polytopes constructed as Cartesian products of two polygons, the duoprisms. It has 9 vertices, 18 edges, 15 faces (9 squares, and 6 triangles), in 6 triangular prism cells. It has Coxeter diagram , and symmetry , order 72. Its vertices and edges form a 3\times 3 rook's graph. Hypervolume The hypervolume of a Uniform_4-polytope#Duoprisms:_.5Bp.5D_.C3.97_.5Bq.5D, uniform 3-3 duoprism, with edge length ''a'', is V_4 = a^4. This is the square of the Equilateral_triangle#Principal_properties, area of an equilateral triangle, A = a^2. Graph The graph of vertices and edges of the 3-3 duoprism has 9 vertices and 18 edges. Like the Berlekamp–van Lint–Seidel graph and the unknown solution to Conway's 99-graph problem, every edge is part of ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Neighborly Polytope
In geometry and polyhedral combinatorics, a -neighborly polytope is a convex polytope in which every set of or fewer vertices forms a face. For instance, a 2-neighborly polytope is a polytope in which every pair of vertices is connected by an edge, forming a complete graph. 2-neighborly polytopes with more than four vertices may exist only in spaces of four or more dimensions, and in general a -neighborly polytope (other than a simplex) requires a dimension of or more. A -simplex is -neighborly. A polytope is said to be neighborly, without specifying , if it is -neighborly for . If we exclude simplices, this is the maximum possible : in fact, every polytope that is -neighborly for some is a simplex. In a -neighborly polytope with , every 2-face must be a triangle, and in a -neighborly polytope with , every 3-face must be a tetrahedron. More generally, in any -neighborly polytope, all faces of dimension less than are simplices. The cyclic polytopes formed as the convex hul ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Convex Polytope
A convex polytope is a special case of a polytope, having the additional property that it is also a convex set contained in the n-dimensional Euclidean space \mathbb^n. Most texts. use the term "polytope" for a bounded convex polytope, and the word "polyhedron" for the more general, possibly unbounded object. Others''Mathematical Programming'', by Melvyn W. Jeter (1986) p. 68/ref> (including this article) allow polytopes to be unbounded. The terms "bounded/unbounded convex polytope" will be used below whenever the boundedness is critical to the discussed issue. Yet other texts identify a convex polytope with its boundary. Convex polytopes play an important role both in various branches of mathematics and in applied areas, most notably in linear programming. In the influential textbooks of Grünbaum and Ziegler on the subject, as well as in many other texts in discrete geometry, convex polytopes are often simply called "polytopes". Grünbaum points out that this is solely to avoi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
N-skeleton
In mathematics, particularly in algebraic topology, the of a topological space presented as a simplicial complex (resp. CW complex) refers to the subspace that is the union of the simplices of (resp. cells of ) of dimensions In other words, given an inductive definition of a complex, the is obtained by stopping at the . These subspaces increase with . The is a discrete space, and the a topological graph. The skeletons of a space are used in obstruction theory, to construct spectral sequences by means of filtrations, and generally to make inductive arguments. They are particularly important when has infinite dimension, in the sense that the do not become constant as In geometry In geometry, a of P (functionally represented as skel''k''(''P'')) consists of all elements of dimension up to ''k''. For example: : skel0(cube) = 8 vertices : skel1(cube) = 8 vertices, 12 edges : skel2(cube) = 8 vertices, 12 edges, 6 square faces For simplicial sets The above def ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Triangular Duoprism YW And ZW Rotations
A triangle is a polygon with three edges and three vertices. It is one of the basic shapes in geometry. A triangle with vertices ''A'', ''B'', and ''C'' is denoted \triangle ABC. In Euclidean geometry, any three points, when non-collinear, determine a unique triangle and simultaneously, a unique plane (i.e. a two-dimensional Euclidean space). In other words, there is only one plane that contains that triangle, and every triangle is contained in some plane. If the entire geometry is only the Euclidean plane, there is only one plane and all triangles are contained in it; however, in higher-dimensional Euclidean spaces, this is no longer true. This article is about triangles in Euclidean geometry, and in particular, the Euclidean plane, except where otherwise noted. Types of triangle The terminology for categorizing triangles is more than two thousand years old, having been defined on the very first page of Euclid's Elements. The names used for modern classification are eit ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Sudoku Graph
In the mathematics of Sudoku, the Sudoku graph is an undirected graph whose vertices represent the cells of a (blank) Sudoku puzzle and whose edges represent pairs of cells that belong to the same row, column, or block of the puzzle. The problem of solving a Sudoku puzzle can be represented as precoloring extension on this graph. It is an integral Cayley graph. Basic properties and examples On a Sudoku board of size n^2\times n^2, the Sudoku graph has n^4 vertices, each with exactly 3n^2-2n-1 neighbors. Therefore, it is a regular graph. The total number of edges is n^4(3n^2-2n-1)/2. For instance, the graph shown in the figure above, for a 4\times 4 board, has 16 vertices and 56 edges, and is 7-regular. For the most common form of Sudoku, on a 9\times 9 board, the Sudoku graph is a 20-regular graph with 81 vertices and 810 edges. The second figure shows how to count the neighbors of each cell in a 9\times 9 board. Puzzle solutions and graph coloring Each row, column, or block ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Latin Square
In combinatorics and in experimental design, a Latin square is an ''n'' × ''n'' array filled with ''n'' different symbols, each occurring exactly once in each row and exactly once in each column. An example of a 3×3 Latin square is The name "Latin square" was inspired by mathematical papers by Leonhard Euler (1707–1783), who used Latin characters as symbols, but any set of symbols can be used: in the above example, the alphabetic sequence A, B, C can be replaced by the integer sequence 1, 2, 3. Euler began the general theory of Latin squares. History The Korean mathematician Choi Seok-jeong was the first to publish an example of Latin squares of order nine, in order to construct a magic square in 1700, predating Leonhard Euler by 67 years. Reduced form A Latin square is said to be ''reduced'' (also, ''normalized'' or ''in standard form'') if both its first row and its first column are in their natural order. For example, the La ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Clique (graph Theory)
In the mathematical area of graph theory, a clique ( or ) is a subset of vertices of an undirected graph such that every two distinct vertices in the clique are adjacent. That is, a clique of a graph G is an induced subgraph of G that is complete. Cliques are one of the basic concepts of graph theory and are used in many other mathematical problems and constructions on graphs. Cliques have also been studied in computer science: the task of finding whether there is a clique of a given size in a graph (the clique problem) is NP-complete, but despite this hardness result, many algorithms for finding cliques have been studied. Although the study of complete subgraphs goes back at least to the graph-theoretic reformulation of Ramsey theory by , the term ''clique'' comes from , who used complete subgraphs in social networks to model cliques of people; that is, groups of people all of whom know each other. Cliques have many other applications in the sciences and particularly in bioinf ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Domination Number
Domination or dominant may refer to: Society * World domination, which is mainly a conspiracy theory * Colonialism in which one group (usually a nation) invades another region for material gain or to eliminate competition * Chauvinism in which a person or group consider themselves to be superior, and thus entitled to use force to dominate others * Sexual dominance involving individuals in a subset of BDSM behaviour * Hierarchy * Patriarchy Music * Dominant (music), a diatonic scale step and diatonic function in tonal music theory * Dominant seventh chord, a four-note chord consisting of a major triad and a minor seventh * ''Domination'' (Cannonball Adderley album), 1965 * ''Domination'' (Domino album), 2004 * ''Domination'' (Morbid Angel album), 1995 * ''Domination'' (Morifade album), 2004 * "Domination", a song by Band-Maid from ''World Domination'' * " Domination", a song by Pantera from ''Cowboys from Hell'' * "Domination", a song by Symphony X from '' Paradise Lost ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Independence Number
Independence is a condition of a person, nation, country, or Sovereign state, state in which residents and population, or some portion thereof, exercise self-government, and usually sovereignty, over its territory. The opposite of independence is the status of a dependent territory. The commemoration of the independence day of a country or nation celebrates when a country is free from all forms of foreign colonialism; free to build a country or nation without any interference from other nations. Definition of independence Whether the attainment of independence is different from revolution has long been contested, and has often been debated over the question of violence as Legitimacy (family law), legitimate means to achieving sovereignty. In general, revolutions aim only to redistribute power with or without an element of emancipation,such as in democratization ''within'' a state, which as such may remain unaltered. For example, the Mexican Revolution (1910) chiefly refer ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
%2C_by_John_Trumbull.jpg "Click for more on -> Independence Number")