We look at a variant of the Hamilton circuit problem, where the input is restricted to hexagonal grid graphs. A hexagonal grid graph has a vertex set that is a subset of the grid points of a regular hexagonal tiling of the plane and edges corresponding to hexagon sides. We show that Hamilton circuit in hexagonal grid graphs is NP-complete.

Image representation always becomes an important and interesting topic in image processing and pattern recognition. Since introduced by Freeman in 1961, that is known as Freeman Chain Code (FCC) the evolution and improvement of chain code representation scheme has been widely used as a topic of research. In 1999, Bribiesca introduced a new two-dimensional chain code scheme that is called Vertex...

Piezoelectric nanobeams having circular, rectangular and hexagonal cross-sections are synthesized and used in various Nano structures; however, piezoelectric nanobeams with hexagonal cross-sections have not been studied in detail. In particular, the physical mechanisms of the surface effect and the role of surface stress, surface elasticity and surface piezoelectricity have not been discussed t...