TOPICS
Search

Search Results for ""


1401 - 1410 of 2291 for Super Edge Graceful GraphSearch Results
A topological space decomposes into its connected components. The connectedness relation between two pairs of points satisfies transitivity, i.e., if a∼b and b∼c then a∼c. ...
The sum over all external (square) nodes of the lengths of the paths from the root of an extended binary tree to each node. For example, in the tree above, the external path ...
The sum I over all internal (circular) nodes of the paths from the root of an extended binary tree to each node. For example, in the tree above, the internal path length is ...
The mean line segment length l^_ is the average length of a line segment in line segment picking within some given shape. As summarized in the following table (where Delta(3) ...
There are (at least) two graphs associated with Ellingham and Horton. These graphs on 54 and 78 nodes respectively, illustrated above, are examples of 3-connected bicubic ...
The Platonic solids, also called the regular solids or regular polyhedra, are convex polyhedra with equivalent faces composed of congruent convex regular polygons. There are ...
A number taken to the power 3 is said to be cubed, so x^3 is called "x cubed." This terminology derives from the fact that the volume of a cube of edge length x is given by ...
The digraph intersection of two digraphs is the digraph whose vertex set (respectively, edge set) is the intersection of their vertex sets (respectively, edge sets). If n is ...
The digraph union of two digraphs is the digraph whose vertex set (respectively, edge set) is the union of their vertex sets (respectively, edge sets). Given a positive ...
The polyhedron compound of the icosidodecahedron and its dual, the rhombic triacontahedron. The compound can be constructed from an icosidodecahedron of unit edge length by ...
1 ... 138|139|140|141|142|143|144 ... 230 Previous Next

...