Cubic graphIn 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. In 1932, Ronald M. Foster began collecting examples of cubic symmetric graphs, forming the start of the Foster census.
Graph factorizationIn graph theory, a factor of a graph G is a spanning subgraph, i.e., a subgraph that has the same vertex set as G. A k-factor of a graph is a spanning k-regular subgraph, and a k-factorization partitions the edges of the graph into disjoint k-factors. A graph G is said to be k-factorable if it admits a k-factorization. In particular, a 1-factor is a perfect matching, and a 1-factorization of a k-regular graph is a proper edge coloring with k colors. A 2-factor is a collection of cycles that spans all vertices of the graph.
5-polytopeIn geometry, a five-dimensional polytope (or 5-polytope) is a polytope in five-dimensional space, bounded by (4-polytope) facets, pairs of which share a polyhedral cell. A 5-polytope is a closed five-dimensional figure with vertices, edges, faces, and cells, and 4-faces. A vertex is a point where five or more edges meet. An edge is a line segment where four or more faces meet, and a face is a polygon where three or more cells meet. A cell is a polyhedron, and a 4-face is a 4-polytope.
24 (number)24 (twenty-four) is the natural number following 23 and preceding 25. 24 is an even composite number, with 2 and 3 as its distinct prime factors. It is the first number of the form 2^qq, where q is an odd prime. It is the smallest number with at least eight positive divisors: 1, 2, 3, 4, 6, 8, 12, and 24; thus, it is a highly composite number, having more divisors than any smaller number. Furthermore, it is an abundant number, since the sum of its proper divisors (36) is greater than itself, as well as a superabundant number.
99 (nine) is the natural number following and preceding . Hindu–Arabic numeral system Circa 300 BCE, as part of the Brahmi numerals, various Indians wrote a digit 9 similar in shape to the modern closing question mark without the bottom dot. The Kshatrapa, Andhra and Gupta started curving the bottom vertical line coming up with a -look-alike. The Nagari continued the bottom stroke to make a circle and enclose the 3-look-alike, in much the same way that the sign @ encircles a lowercase a.
Five-dimensional spaceA five-dimensional space is a space with five dimensions. In mathematics, a sequence of N numbers can represent a location in an N-dimensional space. If interpreted physically, that is one more than the usual three spatial dimensions and the fourth dimension of time used in relativistic physics. Whether or not the universe is five-dimensional is a topic of debate. Much of the early work on five-dimensional space was in an attempt to develop a theory that unifies the four fundamental interactions in nature: strong and weak nuclear forces, gravity and electromagnetism.
Apollonian networkIn combinatorial mathematics, an Apollonian network is an undirected graph formed by a process of recursively subdividing a triangle into three smaller triangles. Apollonian networks may equivalently be defined as the planar 3-trees, the maximal planar chordal graphs, the uniquely 4-colorable planar graphs, and the graphs of stacked polytopes. They are named after Apollonius of Perga, who studied a related circle-packing construction.
Combinatorial proofIn mathematics, the term combinatorial proof is often used to mean either of two types of mathematical proof: A proof by double counting. A combinatorial identity is proven by counting the number of elements of some carefully chosen set in two different ways to obtain the different expressions in the identity. Since those expressions count the same objects, they must be equal to each other and thus the identity is established. A bijective proof. Two sets are shown to have the same number of members by exhibiting a bijection, i.
