A description is given of finite permutation groups containing a cyclic regular subgroup. It is then applied to derive a classification of arc transitive circulants, completing the work dating from 1970’s. It is shown that a connected arc transitive circulant of order n is one of the following: a complete graph Kn , a lexicographic product [K̄b], a deleted lexicographic product [K̄b] − b , where ...

Isochronal maps of ventricular activation were analyzed in dogs 3-5 days after ligation of the left anterior descending coronary artery utilizing a 64-channel multiplexer. Isochronal maps of the effective refractory period were determined from 62 epicardial sites and correlated with the activation maps. The ischemia occurring in the surviving epicardial layer prolonged refractoriness in a spati...

The feedback vertex set (FVS) problem is to find the set of vertices of minimum cardinality whose removal renders the graph acyclic. The FVS problem has applications in several areas such as combinatorial circuit design, synchronous systems, computer systems, and very-large-scale integration (VLSI) circuits. The FVS problem is known to be NP-hard for simple graphs, but polynomial-time algorithm...

In this paper we give a characterization of kernel-perfect (and of critical kernel-imperfect) arc-local tournament digraphs. As a consequence, we prove that arc-local tournament digraphs satisfy a strenghtened form of the following interesting conjecture which constitutes a bridge between kernels and perfectness in digraphs, stated by C. Berge and P. Duchet in 1982: a graph G is perfect if and ...

Anodic arc discharge supported by the erosion of the anode material is one of the most practical and efficient methods to synthesize various high-quality carbon nanostructures including nanotubes, graphene due to its relatively higher growth temperature and eco-friendly procedures. In order to increase the arc controllability of the as-synthesized products, we introduced a non-uniform magnetic ...

In this paper we introduce and study a type of Cayley graph – subnormal graph. We prove that 2-arc transitive is normal or cover complete bipartite $\mathbf{K}_{p^d,p^d}$ with $p$ prime. Then obtain generic method for constructing half-symmetric (namely edge but not arc transitive) graphs.

Submit Manuscript | http://medcraveonline.com Abbreviations: TCP: Tumor Control Probability; NTCP: Normal Tissue Control Probability; LKB: Lyman Kutcher Burman; IGRT: Image Guided Radiation Therapy; IMRT: Intensity Modulated Radiation Therapy; SIB-IMRT: Simultaneous Integrated BoostIMRT; VMAT: Volumetric Modulated Arc Therapy; DA: Double Arc; SA: Single Arc; HT: Helical Tomotherapy; IFP: Improv...