TOPICS
Search

Search Results for ""


1181 - 1190 of 2186 for k Connected GraphSearch Results
For a given positive integer n, does there exist a weighted tree with n graph vertices whose paths have weights 1, 2, ..., (n; 2), where (n; 2) is a binomial coefficient? ...
The shortest circular sequence of length sigma^n such that every string of length n on the alphabet a of size sigma occurs as a contiguous subrange of the sequence described ...
A hexahedron is a polyhedron with six faces. The figure above shows a number of named hexahedra, in particular the acute golden rhombohedron, cube, cuboid, hemicube, ...
Combinatorial matrix theory is a rich branch of mathematics that combines combinatorics, graph theory, and linear algebra. It includes the theory of matrices with prescribed ...
C_7 is the cyclic group that is the unique group of group order 7. Examples include the point group C_7 and the integers modulo 7 under addition (Z_7). No modulo ...
The Goddard-Henning enneahedron, a term coined here, is the canonical polyhedron obtained from the Goddard-Henning graph. It has 9 vertices, 16 edges (consisting of 3 ...
The Goldner-Harary polyhedron is the term given in this work to the polyhedral embedding of the Goldner-Harary graph. This solid is an augmented triangular dipyramid, a ...
In calculus, geometry, and plotting contexts, the term "linear function" means a function whose graph is a straight line, i.e., a polynomial function of degree 0 or 1. A ...
The word "order" is used in a number of different ways in mathematics. Most commonly, it refers to the number of elements in (e.g., conjugacy class order, graph order, group ...
The truncated pentakis dodecahedron is a polyhedron on 180 vertices, 270 edges, and 92 faces. Its canonical polyhedron has edges of three different lengths and faces ...
1 ... 116|117|118|119|120|121|122 ... 219 Previous Next

...