HOME
*



picture info

Brouwer–Haemers Graph
In the mathematical field of graph theory, the Brouwer–Haemers graph is a 20- regular undirected graph with 81 vertices and 810 edges. It is a strongly regular graph, a distance-transitive graph, and a Ramanujan graph. Although its construction is folklore, it was named after Andries Brouwer and Willem H. Haemers, who proved its uniqueness as a strongly regular graph. Construction The Brouwer–Haemers graph has several related algebraic constructions. One of the simplest is as a degree-4 generalized Paley graph: it can be defined by making a vertex for each element in the finite field GF(81) and an edge for every two elements that differ by a fourth power. Properties The Brouwer–Haemers graph is the unique strongly regular graph with parameters (81, 20, 1, 6). This means that it has 81 vertices, 20 edges per vertex, 1 triangle per edge, and 6 length-two paths connecting each non-adjacent pair of vertices. As a strongly regular graph with the third para ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  




Brouwer Haemers Graph
Brouwer (also Brouwers and de Brouwer) is a Dutch and Flemish surname. The word ''brouwer'' means 'beer brewer'. Brouwer * Adriaen Brouwer (1605–1638), Flemish painter * Alexander Brouwer (b. 1989), Dutch beach volleyball player * Andries Brouwer (b. 1953), Dutch mathematician and computer programmer **Brouwer–Haemers graph * Bertha "Puck" Brouwer (1930–2006), Dutch sprinter * Carolijn Brouwer (b. 1973), Dutch competitive sailor * Christoph Brouwer (1559–1617), Dutch Catholic ecclesiastical historian * Cornelis Brouwer (–1681), Dutch Golden Age painter * Cornelis Brouwer (1900–1952), Dutch long-distance runner * Dirk Brouwer (1899–1941), Dutch architect and resistance member * Dirk Brouwer (1902–1966), Dutch-American astronomer ** Brouwer Award, Dirk Brouwer Award, 1746 Brouwer asteroid * Emanuel Brouwer (1881–1954), Dutch gymnast * George Brouwer, Australian lawyer, Ombudsman for Victoria * Harm Brouwer (b. 1957), Dutch politician * Hendrik Brouwer (1580 ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Fourth Power
In arithmetic and algebra, the fourth power of a number ''n'' is the result of multiplying four instances of ''n'' together. So: :''n''4 = ''n'' × ''n'' × ''n'' × ''n'' Fourth powers are also formed by multiplying a number by its cube. Furthermore, they are squares of squares. The sequence of fourth powers of integers (also known as biquadrates or tesseractic numbers) is: :0, 1, 16, 81, 256, 625, 1296, 2401, 4096, 6561, 10000, 14641, 20736, 28561, 38416, 50625, 65536, 83521, 104976, 130321, 160000, 194481, 234256, 279841, 331776, 390625, 456976, 531441, 614656, 707281, 810000, ... . Properties The last digit of a fourth power in decimal can only be 0 (in fact 0000), 1, 5 (in fact 0625), or 6. Every positive integer can be expressed as the sum of at most 19 fourth powers; every integer larger than 13792 can be expressed as the sum of at most 16 fourth powers (see Waring's problem). Fermat knew that a fourth power cannot be the sum of two other fourth powers (the ''n'' = ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Notices Of The American Mathematical Society
''Notices of the American Mathematical Society'' is the membership journal of the American Mathematical Society (AMS), published monthly except for the combined June/July issue. The first volume appeared in 1953. Each issue of the magazine since January 1995 is available in its entirety on the journal web site. Articles are peer-reviewed by an editorial board of mathematical experts. Since 2019, the editor-in-chief is Erica Flapan. The cover regularly features mathematical visualization Mathematical phenomena can be understood and explored via visualization. Classically this consisted of two-dimensional drawings or building three-dimensional models (particularly plaster models in the 19th and early 20th century), while today it ...s. The ''Notices'' is self-described to be the world's most widely read mathematical journal. As the membership journal of the American Mathematical Society, the ''Notices'' is sent to the approximately 30,000 AMS members worldwide, one-third of whom ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Journal Of Combinatorial Theory
The ''Journal of Combinatorial Theory'', Series A and Series B, are mathematical journals specializing in combinatorics and related areas. They are published by Elsevier. ''Series A'' is concerned primarily with structures, designs, and applications of combinatorics. ''Series B'' is concerned primarily with graph and matroid theory. The two series are two of the leading journals in the field and are widely known as ''JCTA'' and ''JCTB''. The journal was founded in 1966 by Frank Harary and Gian-Carlo Rota.They are acknowledged on the journals' title pages and Web sites. SeEditorial board of JCTAEditorial board of JCTB
Originally there was only one journal, which was split into two parts in 1971 as the field grew rapidly. An electronic,

picture info

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 ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

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 bioin ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Sudoku
Sudoku (; ja, 数独, sūdoku, digit-single; originally called Number Place) is a logic-based, combinatorial number-placement puzzle. In classic Sudoku, the objective is to fill a 9 × 9 grid with digits so that each column, each row, and each of the nine 3 × 3 subgrids that compose the grid (also called "boxes", "blocks", or "regions") contain all of the digits from 1 to 9. The puzzle setter provides a partially completed grid, which for a well-posed puzzle has a single solution. French newspapers featured variations of the Sudoku puzzles in the 19th century, and the puzzle has appeared since 1979 in puzzle books under the name Number Place. However, the modern Sudoku only began to gain widespread popularity in 1986 when it was published by the Japanese puzzle company Nikoli under the name Sudoku, meaning "single number". It first appeared in a U.S. newspaper, and then ''The Times'' (London), in 2004, thanks to the efforts of Wayne Gould, who devised a ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

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]  




Games Graph
In graph theory, the Games graph is the largest known locally linear strongly regular graph. Its parameters as a strongly regular graph are (729,112,1,20). This means that it has 729 vertices, and 40824 edges (112 per vertex). Each edge is in a unique triangle (it is a locally linear graph) and each non-adjacent pair of vertices have exactly 20 shared neighbors. It is named after Richard A. Games, who suggested its construction in an unpublished communication and wrote about related constructions. Construction The construction of this graph involves the unique (up to symmetry) 56-point cap set (a subset of points with no three in line) in PG(5,3), the five-dimensional projective geometry over a three-element field. The six-dimensional projective geometry, PG(6,3), can be partitioned into a six-dimensional affine space AG(6,3) and a copy of PG(5,3) (the points at infinity with respect to the affine space). The Games graph has as its vertices the 729 points of the affine space AG(6, ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

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]  


picture info

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]  


picture info

Ruzsa–Szemerédi Problem
In combinatorial mathematics and extremal graph theory, the Ruzsa–Szemerédi problem or (6,3)-problem asks for the maximum number of edges in a graph in which every edge belongs to a unique triangle. Equivalently it asks for the maximum number of edges in a balanced bipartite graph whose edges can be partitioned into a linear number of induced matchings, or the maximum number of triples one can choose from n points so that every six points contain at most two triples. The problem is named after Imre Z. Ruzsa and Endre Szemerédi, who first proved that its answer is smaller than n^2 by a slowly-growing (but still unknown) factor. Equivalence between formulations The following questions all have answers that are asymptotically equivalent: they differ by, at most, constant factors from each other. *What is the maximum possible number of edges in a graph with n vertices in which every edge belongs to a unique triangle? The graphs with this property are called locally linear graph ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]