this paper presents a new method called vespiary regular hexagonal (vrh) model to calculate parasitic capacitance between conductor wire filaments of one turn of a coil and between conductor wires filament and liner and also total capacitance of n-turns having single-layers, multi-conductor wire filaments of the helix magneto cumulative generator (mcg) coil. the presented method is an analytica...

This paper presents an approach to calculate the equivalent stray capacitance (SC) of n-turn of the helical flux compression generator (HFCG) coil with multi layer conductor wire filaments (MLCWF) in the form of rectangular cross-section. This approach is based on vespiary regular hexagonal (VRH) model. In this method, wire filaments of the generator coil are separated into many very small simi...

This paper presents a new method called vespiary regular hexagonal (VRH) model in order to calculate parasitic capacitance between conductor wire filaments of one turn of coil (OTC) and between conductor wire filaments and liner and also total capacitance of one turn of the helix magneto flux cumulative generator (MCG) coil include single-layer conductor wire filaments in form of rectangular cr...

The point-spread function and emissivity are calculated for a mirror made from regular hexagonal segments of just a few different sizes. A mirror of this type has many similar segments, which is an advantage for manufacturing, and for an approximately f/1 mirror with > or = 1000 segments and > or = 4 sizes of regular hexagons the increase in intersegment gap area is negligible. This result rais...

A lot of research and various techniques have been devoted for finding the topological descriptor Wiener index, but most of them deal with only particular cases. There exist three regular plane tessellations, composed of the same kind of regular polygons namely triangular, square, and hexagonal. Using edge congestion-sum problem, we devise a method to compute the Wiener index and demonstrate th...

a lot of research and various techniques have been devoted for finding the topologicaldescriptor wiener index, but most of them deal with only particular cases. there exist threeregular plane tessellations, composed of the same kind of regular polygons namely triangular,square, and hexagonal. using edge congestion-sum problem, we devise a method to computethe wiener index and demonstrate this m...

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.

Chinese checkers is a game played on a hexagonal grid. This regular hexagonal tesselation is an artifact of Euclidean geometry that provides a fair playing eld only for games of two, three, four or six players. Hyperbolic geometry allows tessallations of the plane by regular polygons with any number of sides. Hyperbolic versions of the chinese checkers board permit fair games with ve, seven and...