Let G be a graph of order p and size q. An (a, d)-edge-antimagic total labeling of G is a one-to-one map f taking the vertices and edges onto 1, 2, . . . , p + q so that the edge-weights w(u, v) = f(u) + f(v) + f(uv), uv ∈ E(G), form an arithmetic progression, starting from a and having common difference d. Moreover, such a labeling is called super (a, d)edge-antimagic total if f(V (G)) = {1, 2...

In octilinear drawings of planar graphs, every edge is drawn as an alternating sequence of horizontal, vertical and diagonal (45◦) line-segments. In this paper, we study octilinear drawings of low edge complexity, i.e., with few bends per edge. A k-planar graph is a planar graph in which each vertex has degree less or equal to k. In particular, we prove that every 4-planar graph admits a planar...

This paper addresses the problem of recovering a super-resolved image from a single low resolution input. This is a hybrid approach of single image super resolution. The technique is based on combining an Iterative back projection (IBP) method with the edge preserving Infinite symmetrical exponential filter (ISEF). Though IBP can minimize the reconstruction error significantly in iterative mann...

Abstract The edge detection of microstructures by microscopes is poor in resolution due to the effect of diffraction limit. This paper proposes a new technique by using the focus probe in association with a nanopositioning stage. The edge is detected by the total energy reflection principle and the step height is detected by the astigmatic principle. Both methods can realize the resolution of 1...

A (p,q) graph G is total edge-magic if there exits a bijection f: Vu E ~ {1.2,. .. ,p+q} such that for each e=(u,v) in E, we have feu) + fee) + f(v) as a constant. For a graph G, denote M(G) the set of all total edge-magic labelings. The magic strength of G is the minimum of all constants among all labelings in M(G), and denoted by emt(G). The maximum of all constants among M(G) is called the m...

Two-dimensional weakly-singular Symmetric Galerkin Boundary Elements (SGBEMs) are developed, following the work of [Han and Atluri (2003)], using non-hypersingular integral equations for tractions. Specifically, the present 2D SGBEM is used to compute the stress intensity factors for arbitrary-shaped line cracks, including embedded, edge, branching, and intersecting cracks. The computed stress ...