Search Results for ""

An analog of the polyominoes and polyiamonds in which collections of regular hexagons are arranged with adjacent sides. They are also called hexes, hexas, or polyfrobs ...

The Dyck graph is unique cubic symmetric graph on 32 nodes, illustrated above in a number of embeddings. It is denoted F_(032)A in the Foster census of cubic symmetric graphs ...

The Harary index of a graph G on n vertices was defined by Plavšić et al. (1993) as H(G)=1/2sum_(i=1)^nsum_(j=1)^n(RD)_(ij), (1) where (RD)_(ij)={D_(ij)^(-1) if i!=j; 0 if ...

The odd graph O_n of order n is a graph having vertices given by the (n-1)-subsets of {1,...,2n-1} such that two vertices are connected by an edge iff the associated subsets ...

The Wiener index W, denoted w (Wiener 1947) and also known as the "path number" or Wiener number (Plavšić et al. 1993), is a graph index defined for a graph on n nodes by ...

The objective of global optimization is to find the globally best solution of (possibly nonlinear) models, in the (possible or known) presence of multiple local optima. ...

In mathematics, a knot is defined as a closed, non-self-intersecting curve that is embedded in three dimensions and cannot be untangled to produce a simple loop (i.e., the ...