In this article, a systematic procedure has been explored to studying general Zq-equivariant planar polynomial Hamiltonian vector fields for the maximal number of closed orbits and the maximal number of limit cycles after perturbation. Following the procedure by taking special consideration of Z12-equivariant vector fields of degree 11, the maximal of 99 closed orbits are obtained under a well-...

In this study, we address the independent set enumeration problem. Although several efficient algorithms and careful analyses have been proposed for maximal sets, no fine-grained analysis has given non-maximal variant. As main result, propose an algorithm variant that runs in O(q) amortized time linear space, where q is clique number, i.e., maximum size of a input graph. Note works correctly ev...

Tuza (1981) conjectured that the size ? ( G ) of a minimum set edges intersects every triangle graph is at most twice ? maximum edge-disjoint triangles . In this paper we present three results regarding Tuza’s Conjecture. We verify it for graphs with treewidth 6; show ? 3 2 planar triangulation different from K 4 ; and 9 5 + 1 if maximal 3. Our first result strengthens Tuza, implying 8 -free ch...

A morph between two straight-line planar drawings of the same graph is a continuous transformation from the first to the second drawing such that planarity is preserved at all times. Each step of the morph moves each vertex at constant speed along a straight line. Although the existence of a morph between any two drawings was established several decades ago, only recently it has been proved tha...

We present the near-Maximal Algorithm for Poisson-disk Sampling (nMAPS) to generate point distributions variable resolution Delaunay triangular and tetrahedral meshes in two three-dimensions, respectively. nMAPS consists of principal stages. In first stage, an initial distribution is produced using a cell-based rejection algorithm. second holes sample are detected efficient background grid fill...

introduction: hemangiomas are the most frequent benign tumors of the liver and detecting them from metastasis or other malignant hepatic tumors is of outmost importance. 99mtc- rbc scan is highly specific and is the method of choice for this differentiation. this scintigraphy is performed in planar and spect modes. these two procedures are in agreement most of the times, however since spect is ...

The paper is devoted to estimates of the spanning tree congestion for some planar graphs. The main results of the paper: (1) We almost determined (up to ±1) the maximal possible spanning tree congestion for planar graphs. (2) The value of congestion indicator introduced in Ostrovskii [Discrete Math. 310 (2010), no. 6–7, 1204–1209] can be very far from the value of the spanning tree congestion. ...

Numerous models of industrial processes such as diffusion in glassy polymers or solidification phenomena, lead to general one-phase free boundary value problems with phase onset. In this paper we develop a framework viable to prove global existence and stability of planar solutions to one such multidimensional model whose application is in controlled-release pharmaceuticals. We utilize a bounda...

this paper is dedicated to propose an algorithm in order to generate the certain isomers of some well-known fullerene bases. furthermore, we enlist the bipartite edge frustration correlated with some of symmetrically distinct innite families of fullerenes generated by the oered process.