TOPICS
Search

Search Results for ""


1381 - 1390 of 2291 for Super Edge Graceful GraphSearch Results
Given three noncollinear points, construct three tangent circles such that one is centered at each point and the circles are pairwise tangent to one another. Then there exist ...
The Hamming distance between two vertices of a hypercube is the number of coordinates at which the two vertices differ.
An n-route is defined as a walk of length n with specified initial point in which no line succeeds itself.
The polyhedron compound of the small rhombicuboctahedron and its dual, the deltoidal icositetrahedron. The compound can be constructed from a small rhombicuboctahedron of ...
The pentatope is the simplest regular figure in four dimensions, representing the four-dimensional analog of the solid tetrahedron. It is also called the 5-cell, since it ...
Araya and Wiener (2011) found the two cubic planar hypohamiltonian graphs on 70 and 88 vertices, respectively, illustrated above.
The set of all centroid points in a weighted tree (Harary 1994, p. 36).
The Johnson solids are the convex polyhedra having regular faces and equal edge lengths (with the exception of the completely regular Platonic solids, the "semiregular" ...
The Spencer-Brown form is a simple mathematical concept that formalizes what a mathematical object is formally identical to what it is not (Spencer-Brown 1997, pp. ix and ...
Chebyshev iteration is a method for solving nonsymmetric problems (Golub and van Loan 1996, §10.1.5; Varga, 1962, Ch. 5). Chebyshev iteration avoids the computation of inner ...
1 ... 136|137|138|139|140|141|142 ... 230 Previous Next

...