Search Results for ""

In antiquity, geometric constructions of figures and lengths were restricted to the use of only a straightedge and compass (or in Plato's case, a compass only; a technique ...

As proposed by Hosoya (1971), the Hosoya index (also called Z-index) of a graph is defined by Z = sum_(k=0)^(n)|a_k| (1) = sum_(k=0)^(n)b_k, (2) where n is the number of ...

The (upper) vertex independence number of a graph, often called simply "the" independence number, is the cardinality of the largest independent vertex set, i.e., the size of ...

An independent vertex set of a graph G is a subset of the vertices such that no two vertices in the subset represent an edge of G. The figure above shows independent sets ...

Origami is the Japanese art of paper folding. In traditional origami, constructions are done using a single sheet of colored paper that is often, though not always, square. ...

The word polyhedron has slightly different meanings in geometry and algebraic geometry. In geometry, a polyhedron is simply a three-dimensional solid which consists of a ...

Consecutive number sequences are sequences constructed by concatenating numbers of a given type. Many of these sequences were considered by Smarandache and so are sometimes ...

Iofinova and Ivanov (1985) showed that there exist exactly five bipartite cubic semisymmetric graphs whose automorphism groups preserves the bipartite parts and acts ...

The (lower) domination number gamma(G) of a graph G is the minimum size of a dominating set of vertices in G, i.e., the size of a minimum dominating set. This is equivalent ...

Smarandache sequences are any of a number of simply generated integer sequences resembling those considered in published works by Smarandache such as the consecutive number ...