|
Three Utilities Problem
The classical mathematical puzzle known as the three utilities problem or sometimes water, gas and electricity asks for non-crossing connections to be drawn between three houses and three utility companies in the plane. When posing it in the early 20th century, Henry Dudeney wrote that it was already an old problem. It is an impossible puzzle: it is not possible to connect all nine lines without crossing. Versions of the problem on nonplanar surfaces such as a torus or Möbius strip, or that allow connections to pass through other houses or utilities, can be solved. This puzzle can be formalized as a problem in topological graph theory by asking whether the complete bipartite graph K_, with vertices representing the houses and utilities and edges representing their connections, has a graph embedding in the plane. The impossibility of the puzzle corresponds to the fact that K_ is not a planar graph. Multiple proofs of this impossibility are known, and form part of the proof of ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
3 Utilities Problem Plane
3 (three) is a number, numeral (linguistics), numeral and numerical digit, digit. It is the natural number following 2 and preceding 4, and is the smallest odd prime number and the only prime preceding a square number. It has religious or cultural significance in many societies. Evolution of the Arabic digit The use of three lines to denote the number 3 occurred in many writing systems, including some (like Roman and Chinese numerals) that are still in use. That was also the original representation of 3 in the Brahmic numerals, Brahmic (Indian) numerical notation, its earliest forms aligned vertically. However, during the Gupta Empire the sign was modified by the addition of a curve on each line. The Nāgarī script rotated the lines clockwise, so they appeared horizontally, and ended each line with a short downward stroke on the right. In cursive script, the three strokes were eventually connected to form a glyph resembling a with an additional stroke at the bottom: ३. ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Cubic Graph
In the mathematical field of graph theory, a cubic graph is a graph in which all vertices have degree three. In other words, a cubic graph is a 3-regular graph. Cubic graphs are also called trivalent graphs. A bicubic graph is a cubic bipartite graph. Symmetry In 1932, Ronald M. Foster began collecting examples of cubic symmetric graphs, forming the start of the Foster census.. Many well-known individual graphs are cubic and symmetric, including the utility graph, the Petersen graph, the Heawood graph, the Möbius–Kantor graph, the Pappus graph, the Desargues graph, the Nauru graph, the Coxeter graph, the Tutte–Coxeter graph, the Dyck graph, the Foster graph and the Biggs–Smith graph. W. T. Tutte classified the symmetric cubic graphs by the smallest integer number ''s'' such that each two oriented paths of length ''s'' can be mapped to each other by exactly one symmetry of the graph. He showed that ''s'' is at most 5, and provided examples of graphs with each possible ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Graph Theory
In mathematics, graph theory is the study of ''graphs'', which are mathematical structures used to model pairwise relations between objects. A graph in this context is made up of '' vertices'' (also called ''nodes'' or ''points'') which are connected by '' edges'' (also called ''links'' or ''lines''). A distinction is made between undirected graphs, where edges link two vertices symmetrically, and directed graphs, where edges link two vertices asymmetrically. Graphs are one of the principal objects of study in discrete mathematics. Definitions Definitions in graph theory vary. The following are some of the more basic ways of defining graphs and related mathematical structures. Graph In one restricted but very common sense of the term, a graph is an ordered pair G=(V,E) comprising: * V, a set of vertices (also called nodes or points); * E \subseteq \, a set of edges (also called links or lines), which are unordered pairs of vertices (that is, an edge is associated with t ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Surface (topology)
In the part of mathematics referred to as topology, a surface is a two-dimensional manifold. Some surfaces arise as the boundaries of three-dimensional solids; for example, the sphere is the boundary of the solid ball. Other surfaces arise as graphs of functions of two variables; see the figure at right. However, surfaces can also be defined abstractly, without reference to any ambient space. For example, the Klein bottle is a surface that cannot be embedded in three-dimensional Euclidean space. Topological surfaces are sometimes equipped with additional information, such as a Riemannian metric or a complex structure, that connects them to other disciplines within mathematics, such as differential geometry and complex analysis. The various mathematical notions of surface can be used to model surfaces in the physical world. In general In mathematics, a surface is a geometrical shape that resembles a deformed plane. The most familiar examples arise as boundaries of solid ob ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Graph (discrete Mathematics)
In discrete mathematics, and more specifically in graph theory, a graph is a structure amounting to a Set (mathematics), set of objects in which some pairs of the objects are in some sense "related". The objects correspond to mathematical abstractions called ''Vertex (graph theory), vertices'' (also called ''nodes'' or ''points'') and each of the related pairs of vertices is called an ''edge'' (also called ''link'' or ''line''). Typically, a graph is depicted in diagrammatic form as a set of dots or circles for the vertices, joined by lines or curves for the edges. Graphs are one of the objects of study in discrete mathematics. The edges may be directed or undirected. For example, if the vertices represent people at a party, and there is an edge between two people if they shake hands, then this graph is undirected because any person ''A'' can shake hands with a person ''B'' only if ''B'' also shakes hands with ''A''. In contrast, if an edge from a person ''A'' to a person ''B'' m ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Embedding
In mathematics, an embedding (or imbedding) is one instance of some mathematical structure contained within another instance, such as a group that is a subgroup. When some object X is said to be embedded in another object Y, the embedding is given by some injective and structure-preserving map f:X\rightarrow Y. The precise meaning of "structure-preserving" depends on the kind of mathematical structure of which X and Y are instances. In the terminology of category theory, a structure-preserving map is called a morphism. The fact that a map f:X\rightarrow Y is an embedding is often indicated by the use of a "hooked arrow" (); thus: f : X \hookrightarrow Y. (On the other hand, this notation is sometimes reserved for inclusion maps.) Given X and Y, several different embeddings of X in Y may be possible. In many cases of interest there is a standard (or "canonical") embedding, like those of the natural numbers in the integers, the integers in the rational numbers, the rational n ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Benzene
Benzene is an organic chemical compound with the molecular formula C6H6. The benzene molecule is composed of six carbon atoms joined in a planar ring with one hydrogen atom attached to each. Because it contains only carbon and hydrogen atoms, benzene is classed as a hydrocarbon. Benzene is a natural constituent of petroleum and is one of the elementary petrochemicals. Due to the cyclic continuous pi bonds between the carbon atoms, benzene is classed as an aromatic hydrocarbon. Benzene is a colorless and highly flammable liquid with a sweet smell, and is partially responsible for the aroma of gasoline. It is used primarily as a precursor to the manufacture of chemicals with more complex structure, such as ethylbenzene and cumene, of which billions of kilograms are produced annually. Although benzene is a major industrial chemical, it finds limited use in consumer items because of its toxicity. History Discovery The word "''benzene''" derives from "''gum benzoin''" (benzoin res ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Chemical Graph Theory
Chemical graph theory is the topology branch of mathematical chemistry which applies graph theory to mathematical modelling of chemical phenomena. The pioneers of chemical graph theory are Alexandru Balaban, Ante Graovac, Iván Gutman, Haruo Hosoya, Milan Randić and Nenad Trinajstić (also Harry Wiener and others). In 1988, it was reported that several hundred researchers worked in this area, producing about 500 articles annually. A number of monographs have been written in the area, including the two-volume comprehensive text by Trinajstić, ''Chemical Graph Theory'', that summarized the field up to mid-1980s. The adherents of the theory maintain that the properties of a chemical graph (i.e., a graph-theoretical representation of a molecule) give valuable insights into the chemical phenomena. Others contend that graphs play only a fringe role in chemical research.D.H. Rouvray, "Combinatorics in Chemistry", pp. 1955-1982, in: Ronald Graham, Martin Grötschel, László Lovász (E ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Structural Rigidity
In discrete geometry and mechanics, structural rigidity is a combinatorial theory for predicting the flexibility of ensembles formed by rigid bodies connected by flexible linkages or hinges. Definitions Rigidity is the property of a structure that it does not bend or flex under an applied force. The opposite of rigidity is flexibility. In structural rigidity theory, structures are formed by collections of objects that are themselves rigid bodies, often assumed to take simple geometric forms such as straight rods (line segments), with pairs of objects connected by flexible hinges. A structure is rigid if it cannot flex; that is, if there is no continuous motion of the structure that preserves the shape of its rigid components and the pattern of their connections at the hinges. There are two essentially different kinds of rigidity. Finite or macroscopic rigidity means that the structure will not flex, fold, or bend by a positive amount. Infinitesimal rigidity means that the st ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Numberlink
Numberlink is a type of logic puzzle involving finding paths to connect numbers in a grid. Rules The player has to pair up all the matching numbers on the grid with single continuous lines (or paths). The lines cannot branch off or cross over each other, and the numbers have to fall at the end of each line (i.e., not in the middle). It is considered that a problem is well-designed only if it has a unique solution and all the cells in the grid are filled, although some Numberlink designers do not stipulate this. History In 1897, a slightly different form of the puzzle was printed in the ''Brooklyn Daily Eagle'', in a column by Sam Loyd. Another early, printed version of ''Number Link'' can be found in Henry Ernest Dudeney's book ''Amusements in mathematics'' (1917) as ''a puzzle for motorists'' (puzzle no. 252). This puzzle type was popularized in Japan by Nikoli as ''Arukone'' (アルコネ, ''Alphabet Connection'') and ''Nanbarinku'' (ナンバーリンク, ''Number Link''). ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Sam Loyd
Samuel Loyd (January 30, 1841 – April 10, 1911), was an American chess player, chess composer, puzzle author, and recreational mathematics, recreational mathematician. Loyd was born in Philadelphia but raised in New York City. As a chess composer, he authored a number of chess problems, often with interesting themes. At his peak, Loyd was one of the best chess players in the US, and was ranked 15th in the world, according to chessmetrics.com. He played in the strong Paris 1867 chess tournament (won by Ignatz von Kolisch) with little success, placing near the bottom of the field. Following his death, his book ''Cyclopedia of 5000 Puzzles'' was published (1914) by his son. His son, named after his father, dropped the "Jr" from his name and started publishing reprints of his father's puzzles. Loyd (senior) was inducted into the US Chess Hall of Fame in 1987. Reputation Loyd is widely acknowledged as one of America's great puzzle writers and popularizers, often mentioned as '' ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
The Strand Magazine
''The Strand Magazine'' was a monthly British magazine founded by George Newnes, composed of short fiction and general interest articles. It was published in the United Kingdom from January 1891 to March 1950, running to 711 issues, though the first issue was on sale well before Christmas 1890. Its immediate popularity is evidenced by an initial sale of nearly 300,000. Sales increased in the early months, before settling down to a circulation of almost 500,000 copies a month, which lasted well into the 1930s. It was edited by Herbert Greenhough Smith from 1891 to 1930. The popularity of Sherlock Holmes became widespread after first appearing in the magazine in 1891. The magazine's original offices were on Burleigh Street off The Strand, London. It was revived in 1998 as a quarterly magazine. Publication history ''The Strand Magazine'' was founded by George Newnes in 1890, and its first edition was dated January 1891. The magazine's original offices were located on Burleigh S ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
2.png "Click for more on -> Benzene")
%2C_vol._65%2C_no._321%2C_September_1917.jpg "Click for more on -> The Strand Magazine")