PURPOSE To evaluate the Mobius second-check dosimetry system by comparing it to ionization-chamber dose measurements collected in the recently released Mobius Verification Phantom™ (MVP). For reference, a comparison of these measurements to dose calculated in the primary treatment planning system (TPS), Varian Eclipse with the AcurosXB dose algorithm, is also provided. Finally, patient dose cal...

INTRODUCTION Mobius syndrome is characterized by damage in the nucleus of the sixth and seventh cranial nerves, with subsequent facial palsy and abduction limitation of the eyes. The aim of this article is to describe the ophthalmological findings of the Mobius syndrome in Mexican children. PATIENTS AND METHODS A cross-sectional, retrospective, observational and descriptive study was conducte...

Abstract. The energy of a simple graph G arising in chemical physics, denoted by E(G), is defined as the sum of the absolute values of eigenvalues of G. We consider the asymptotic energy per vertex (say asymptotic energy) for lattice systems. In general for a type of lattice in statistical physics , to compute the asymptotic energy with toroidal, cylindrical, Mobius-band, Klein-bottle, and free...

Given a graph G, a function f : V (G)→ {1, 2, ..., k} is a k-biranking of G if f(u) = f(v) implies every u-v path contains vertices x and y such that f(x) > f(u) and f(y) < f(u). The birank number of a graph, denoted bi(G), is the minimum k such that G has a k-biranking. In this paper we determine the birank numbers for ladder, prism, and Möbius ladder graphs.

Let r(G) be the minimum number of complete bipartite subgraphs needed to partition the edges of G, and let r'G) be the larger of the number of positive and number of negative eigenvalues of G. It is known that T{G) > r(G); graphs with t(G) = r(G) are called eigensharp. Eigensharp graphs include graphs, trees, cycles Cn with n = 4 or n ^ 4k, prisms Cn\2K2 with n ^ 3fc, "twisted prisms" (also cal...

Graph isomorphism is an important and widely studied computational problem with a yet unsettled complexity. However, the exact complexity is known for isomorphism of various classes of graphs. Recently, [8] proved that planar isomorphism is complete for log-space. We extend this result further to the classes of graphs which exclude K3,3 or K5 as a minor, and give a log-space algorithm. Our algo...

We study the combinatorics of crystal graphs given by highest weight representations types $A_{n}, B_{n}, C_{n}$, and $D_{n}$, uncovering new relations that exist among operators. Much structure in these has been revealed local Stembridge Sternberg. However, there operators are not implied or Sternberg relations. Viewing as edge colored posets, we use poset topology to them. Using lexicographic...

Some years ago we introduced a new topological invariant for foliated manifolds using techniques from noncommutative geometry, in particular the pairing between K-Theory and cyclic cohomology. The motivation came from flat principal G-bundles where the base space is a non simply connected manifold. The computation of this invariant is quite complicated. In this article we try to perform certain...